A computational comparison of several models for the exact solution of the capacity and distance constrained plant location problem

Maria Albareda-Sambola; Elena Fernandez; Gilbert Laporte

首页> 外文期刊>Computers & operations research >A computational comparison of several models for the exact solution of the capacity and distance constrained plant location problem

【24h】

A computational comparison of several models for the exact solution of the capacity and distance constrained plant location problem

机译：容量和距离受限的工厂位置问题的精确解决方案的几种模型的计算比较

获取原文

获取原文并翻译 | 示例

获取外文期刊封面封底 >>

开具论文收录证明 >>

文献代查 >>

页面导航

摘要
著录项
相似文献
相关主题

摘要

The Capacity and Distance Constrained Plant Location Problem is an extension of the discrete capacitated plant location problem, where the customers assigned to each plant have to be assigned to vehicles. In addition to the capacity constraints on the plants, there is a limit on the total distance traveled by each vehicle to serve its assigned customers by means of round trips. This paper presents several formulations for the problem and proposes different families of valid inequalities. The results of extensive computational experiments are presented and analyzed.

机译：容量和距离受限制的工厂位置问题是离散的，受限制的工厂位置问题的扩展，在该问题中，必须将分配给每个工厂的客户分配给车辆。除了工厂的产能限制之外，每辆车通过往返服务其指定客户的总行驶距离也受到限制。本文介绍了该问题的几种公式，并提出了有效不等式的不同族。提出并分析了大量计算实验的结果。

著录项

来源
《Computers & operations research》 |2011年第8期|p.1109-1116|共8页
作者
Maria Albareda-Sambola; Elena Fernandez; Gilbert Laporte;
展开▼
作者单位

Departament d'Estadistica i Investigacio Operativa, Universitat Politecnica de Catalunya, Spain;

Departament d'Estadistica i Investigacio Operativa, Universitat Politecnica de Catalunya, Spain;

Canada Research Chair in Distribution Management, HEC Montreal, Canada;

展开▼
收录信息
原文格式 PDF
正文语种 eng
中图分类
关键词
discrete location;

机译：离散位置;

相似文献

外文文献
中文文献
专利

1. Using Logic-Based Benders Decomposition to Solve the Capacity- and Distance-Constrained Plant Location Problem [J] . Mohammad M. Fazel-Zarandi, J. Christopher Beck INFORMS journal on computing . 2012,第3期

机译：使用基于逻辑的Benders分解解决容量和距离受限的工厂定位问题
2. The Capacity And Distance Constrained Plant Location Problem [J] . Maria Albareda-Sambola, Elena Fernandez, Gilbert Laporte Computers & operations research . 2009,第2期

机译：容量和距离限制的工厂位置问题
3. A comparison of Euclidean Distance, Travel Times, and Network Distances in Location Choice Mixture Models [J] . Buczkowska Sabina, Coulombel Nicolas, de Lapparent Matthieu Networks & Spatial Economics . 2019,第4期

机译：位置选择混合模型中欧氏距离，旅行时间和网络距离的比较
4. Exact solution in one model of cooperative molecular motors Exact solution in one model of cooperative molecular motors Exact solution in one model of cooperative molecular motors [C] . Mikhail M. Stolnitz and Alexey A. Kudryashov Saratov meeting . 2011

机译：一种合作分子电机的一种模型中的精确解决方案在一种合作分子电机的一种模型中的精确解决方案精确溶液中的一种合作分子电机模型中的精确溶液
5. Location-inventory planning models: Capacity issues and solution algorithms. [D] . Ozsen, Leyla. 2004

机译：位置库存计划模型：容量问题和解决方案算法。
6. Advanced Computation Capacity Modeling for Delay-Constrained Placement of IoT Services [O] . Balázs Németh, Balázs Sonkoly 2020

机译：用于IOT服务延迟约束放置的高级计算能力建模
7. A comparison of Euclidean Distance, Travel Times, and Network Distances in Location Choice Mixture Models [O] . Sabina Buczkowska, Nicolas Coulombel, Matthieu de Lapparent 2019

机译：欧几里德距离，旅行时间和网络距离在位置选择混合模型中的比较
8. Exact Solution of Large-Scale Simple Plant Location Problems [R] . Koerkel, M. 1987

机译：大型简易工厂选址问题的精确解

A computational comparison of several models for the exact solution of the capacity and distance constrained plant location problem

摘要

著录项

相似文献

相关主题

期刊订阅