Results 1  10
of
20
A New Generation of Vehicle Routing Research: Robust Algorithms, Addressing Uncertainty
 Operations Research
, 1993
"... In recent years new insights and algorithms have been obtained for the classical, deterministic, vehicle routing problem as well as for natural stochastic and dynamic variations of it. These new developments are based on theoretical analysis, combine probabilistic and combinatorial modelling and ..."
Abstract

Cited by 44 (0 self)
 Add to MetaCart
In recent years new insights and algorithms have been obtained for the classical, deterministic, vehicle routing problem as well as for natural stochastic and dynamic variations of it. These new developments are based on theoretical analysis, combine probabilistic and combinatorial modelling and lead to (1) new algorithms that produce near optimal solutions and (2) a deeper understanding of uncertainty issues in vehicle routing. In this paper we survey these new developments with an emphasis on the insights gained and on the algorithms proposed. Research supported in part by ONR contract N0001490J1649, NSF contracts DDM8922712, DDM9014751, and by a Presidential Young Investigator award DDM9158118 with matching funds from Draper Laboratory. y Sloan School of Management, MIT, Cambridge, MA 02139. z Dept. of Industrial Engineering and Operations Research, Columbia University, NY, NY, 10027 and Department of Operations Research and Management Sciences, Northwestern Universi...
Facility location models for distribution system design
, 2004
"... The design of the distribution system is a strategic issue for almost every company. The problem of locating facilities and allocating customers covers the core topics of distribution system design. Model formulations and solution algorithms which address the issue vary widely in terms of fundamenta ..."
Abstract

Cited by 33 (0 self)
 Add to MetaCart
The design of the distribution system is a strategic issue for almost every company. The problem of locating facilities and allocating customers covers the core topics of distribution system design. Model formulations and solution algorithms which address the issue vary widely in terms of fundamental assumptions, mathematical complexity and computational performance. This paper reviews some of the contributions to the current stateoftheart. In particular, continuous location models, network location models, mixedinteger programming models, and applications are summarized.
A Location Based Heuristic for General Routing Problems
 Operations Research
, 1993
"... We present a general framework for modeling routing problems based on formulating them as a traditional location problem called the Capacitated Concentrator Location Problem. We apply this framework to two classical routing problems: the Capacitated Vehicle Routing Problem and InventoryRouting Prob ..."
Abstract

Cited by 18 (3 self)
 Add to MetaCart
We present a general framework for modeling routing problems based on formulating them as a traditional location problem called the Capacitated Concentrator Location Problem. We apply this framework to two classical routing problems: the Capacitated Vehicle Routing Problem and InventoryRouting Problem. In the former case, the heuristic is proven to be asymptotically optimal for any distribution of customer demands and locations. Computational experiments show that the heuristic performs well for both problems and in most cases outperforms all published heuristics on a set of standard test problems. 1 Introduction Vehicle routing problems have received much attention in recent years due to the increased importance of determining efficient distribution strategies to reduce operational costs in distribution systems. A typical routing problem consists of a fleet of vehicles located at a central depot or warehouse that must be scheduled to provide some type of service to customers geograp...
Probabilistic Analyses and Practical Algorithms for the Vehicle Routing Problem with Time Windows
 Operations Research
, 1993
"... In the Vehicle Routing Problem with Time Windows, a set of customers are served by a fleet of vehicles of limited capacity, initially located at a central depot. Each customer provides a period of time in which they require service, which may consist of repair work or loading/unloading the vehicle. ..."
Abstract

Cited by 11 (2 self)
 Add to MetaCart
In the Vehicle Routing Problem with Time Windows, a set of customers are served by a fleet of vehicles of limited capacity, initially located at a central depot. Each customer provides a period of time in which they require service, which may consist of repair work or loading/unloading the vehicle. The objective is to find tours for the vehicles, such that each customer is served in its time window, the total load on any vehicle is no more than the vehicle capacity, and the total distance traveled is as small as possible. In this paper, we present a characterization of the asymptotic optimal solution value for general distributions of service times, time windows, customer loads and locations. This characterization leads to the development of a new algorithm based on formulating the problem as a stylized location problem. Computational results show that the algorithm is very effective on a set of standard test problems. Research supported in part by ONR contract N0001490J1649 and N...
A Bionomic Approach to the Capacitated pmedian Problem
, 1998
"... This paper advocates the use of the bionomic algorithm, a recently proposed metaheuristic technique, as an effective method to solve capacitated pmedian problems (CPMP). Bionomic algorithms already proved to be an effective framework for finding good solutions to combinatorial optimization problems ..."
Abstract

Cited by 10 (1 self)
 Add to MetaCart
This paper advocates the use of the bionomic algorithm, a recently proposed metaheuristic technique, as an effective method to solve capacitated pmedian problems (CPMP). Bionomic algorithms already proved to be an effective framework for finding good solutions to combinatorial optimization problems, when good local optimization algorithms are available. The paper also presents an effective local search technique for the CPMP. Computational results show the effectiveness of the proposed approach, when compared to the best performing heuristics so far presented in the literature. Correspondence to: Vittorio Maniezzo, Scienze Informazione, Univ. Bologna, via Sacchi 3, 47023 Cesena, Italy. 2 1 Introduction The capacitated pmedian problem (CPMP) considered in this paper is the problem of partitioning a set of n weighted entities (objects, customers,...) into p disjoint clusters, so that the total dissimilarity within each cluster is minimized and constraints on maximum cluster capaciti...
Design and dimensioning of a novel compositestar WDM network with TDM channel partitioning
 Proceedings of IEEE Third International Conference on Broadband Communications, Networks and Systems
, 2006
"... Abstract — This paper presents the design and dimensioning optimization of a novel optical network structure, called the Petaweb, having a total capacity of several Pb/s (10 15 bit/s). Its topology is a superimposition of stars that drastically eases signaling and switching operations. Firstly, we d ..."
Abstract

Cited by 9 (9 self)
 Add to MetaCart
Abstract — This paper presents the design and dimensioning optimization of a novel optical network structure, called the Petaweb, having a total capacity of several Pb/s (10 15 bit/s). Its topology is a superimposition of stars that drastically eases signaling and switching operations. Firstly, we deal with the network model, focusing on the insertion of the timesharing of the optical channel in network components and in lightpath provisioning. The design problem is jointly a network dimensioning and an assignment problem; we propose for the dimensioning an integer linear programming formulation and a linear resolution algorithm for the assignment. We also propose the use of a quasiregular topology extracted from the optimized regular topology to reduce costs and improve the network utilization. I.
Optimization of a Dedicated Path Protected TDM/WDM Petaweb Architecture
 Riva Del Garda, Italy
, 2006
"... This paper deals with the insertion of a dedicated path protection strategy in the design of a novel optical network structure, called PetaWeb, that can reach a total capacity of several Pb/s (10 15 bit/s). Prior studies of the same authors have tackled the optimization of a PetaWeb network architec ..."
Abstract

Cited by 5 (5 self)
 Add to MetaCart
This paper deals with the insertion of a dedicated path protection strategy in the design of a novel optical network structure, called PetaWeb, that can reach a total capacity of several Pb/s (10 15 bit/s). Prior studies of the same authors have tackled the optimization of a PetaWeb network architecture with a regular compositestar topology and with a quasiregular topology. In this paper, a protection strategy is added to the network model modifying the optimization algorithm. The results show that the optimized PetaWeb architecture is reliable and that every edge node is connected to at least two switching sites. We highlight the strength of the proposed network model for this compositestar architecture: a fastswitching backbone that eases signaling and switching operations at a competitive network cost. The network cost is evaluated on real physical costs and on a virtual cost due to lightpaths propagation delays. 1 1
Telecommunication and Location
, 2001
"... We review the models for telecommunication network design where there is a location problem involved. We classify the models into three classes as uncapacitated, capacitated and dynamic models. For each class, we discuss the core problem, its generalizations and the solution methods in the litera ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
We review the models for telecommunication network design where there is a location problem involved. We classify the models into three classes as uncapacitated, capacitated and dynamic models. For each class, we discuss the core problem, its generalizations and the solution methods in the literature.
Genetic Algorithms for the Single Source Capacitated Location Problem: A Computational Study
, 2001
"... In the Single Source Capacitated Location Problem (SSCLP) a set I = .., n} of possible plant locations, each with a maximum capacity a i , i I,andasetJ = .., m} of customers, each with a demand b j , j J,aregiven. It is required to choose a subset of plants and to fully assign each cu ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
In the Single Source Capacitated Location Problem (SSCLP) a set I = .., n} of possible plant locations, each with a maximum capacity a i , i I,andasetJ = .., m} of customers, each with a demand b j , j J,aregiven. It is required to choose a subset of plants and to fully assign each customer to one of the chosen plants, in such a way that the total cost is minimized, and the plant capacities are not exceeded. Total cost is composed by fixed costs, f i , i I, whenever plant i is open, and by the cost of assigning each customer to one plant, c ij , i I, j J . Considering x ij = 1, if customer j is assigned to plant i and y i = 1, if plant i is open 0, otherwise the SSCLP can be formulated as follows: min c ij x ij + f i y i (1) subject to x ij =1 j =1, .., m (2) b j x ij a i y i i =1, .., n (3) x ij 1} i =1, .., n, j =1, .., m (4) y i 1} i =1, .., n (5) Constraints (2) stipulate that each customer must be assign
A Survivable CompositeStar Optical Transport Network with Disconnected Core Switches
, 2007
"... Les textes publiés dans la série des rapports de recherche HEC n’engagent que la responsabilité de leurs auteurs. La publication de ces rapports de recherche bénéficie d’une subvention du Fonds québécois de la recherche sur la nature et les technologies. ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Les textes publiés dans la série des rapports de recherche HEC n’engagent que la responsabilité de leurs auteurs. La publication de ces rapports de recherche bénéficie d’une subvention du Fonds québécois de la recherche sur la nature et les technologies.