TITLE

Heuristic Approaches for the Fleet Size and Mix Vehicle Routing Problem with Time Windows

AUTHOR(S)
Dell'Amico, Mauro; Monaci, Michele; Pagani, Corrado; Vigo, Daniele
PUB. DATE
November 2007
SOURCE
Transportation Science;Nov2007, Vol. 41 Issue 4, p516
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
The fleet size and mix vehicle routing problem with time windows (FSMVRPTW) is the problem of determining, at the same time, the composition and the routing of a fleet of heterogeneous vehicles aimed to serve a given set of customers. The routing problem requires us to design a set of minimum-cost routes originating and terminating at a central depot and serving customers with known demands, within given time windows. This paper develops a constructive insertion heuristic and a metaheuristic algorithm for FSMVRPTW. Extensive computational experiments on benchmark instances show that the proposed method is robust and efficient, and outperforms the previously published results.
ACCESSION #
28031259

 

Related Articles

  • Solving the Capacitated Location-Routing Problem by a Cooperative Lagrangean Relaxation-Granular Tabu Search Heuristic. Prins, Christian; Prodhon, Caroline; Ruiz, Angel; Soriano, Patrick; Calvo, Roberto Wolfler // Transportation Science;Nov2007, Vol. 41 Issue 4, p470 

    Most of the time in a distribution system, depot location and vehicle routing are interdependent, and recent studies have shown that the overall system cost may be excessive if routing decisions are ignored when locating depots. The location-routing problem (LRP) overcomes this drawback by...

  • The Minisum Multipurpose Trip Location Problem on Networks. Berman, Oded; Rongbing Huang // Transportation Science;Nov2007, Vol. 41 Issue 4, p500 

    We investigate multipurpose trip location problems on networks with two different types of facilities and three groups of customers, two of which need only one type of service, while the third group needs both types of service in a single trip. The objective is to minimize the total weighted...

  • An Intersection-Movement-Based Dynamic User Optimal Route Choice Problem. Jiancheng Long; Hai-Jun Huang; Ziyou Gao; Szeto, W. Y. // Operations Research;Sep/Oct2013, Vol. 61 Issue 5, p1134 

    In this paper a novel variational inequality (VI) formulation of the dynamic user optimal (DUO) route choice problem is proposed using the concept of approach proportion. An approach proportion represents the proportion of travelers that select a turning or through movement when leaving a node....

  • The Hub Line Location Problem. de Sá, Elisangela Martins; Contreras, Ivan; Cordeau, Jean-François; de Camargo, Ricardo Saraiva; de Miranda, Gilberto // Transportation Science;Aug2015, Vol. 49 Issue 3, p500 

    This paper presents the hub line location problem in which the location of a set of hub facilities connected by means of a path (or line) is considered. Potential applications arise in the design of public transportation and rapid transit systems, where network design costs greatly dominate...

  • The port that built the city -- Port of Baltimore celebrates its tricentennial year.  // Journal of Commerce (1542-3867);4/17/2006 Supplement, Vol. 7, p6B 

    Provides information on the Port of Baltimore in Maryland. History of the port; Annual revenue generated by the port; Economic significance of the port; Factors associated with the quality of customer service provided at the port.

  • Cryogenic Transportation opens terminal.  // Modern Bulk Transporter;Jun2004, Vol. 66 Issue 12, p10 

    Reports on the establishment of a new terminal facility by Cryogenic Transportation Inc. in Salt Lake City, Utah. Expansion of business operations; Management of the terminal by Roger Webster; Improvement of the distribution capabilities with key customers.

  • The Stochastic Multiperiod Location Transportation Problem. Klibi, Walid; Lasalle, Francis; Martel, Alain; Ichoua, Soumia // Transportation Science;May2010, Vol. 44 Issue 2, p221 

    This paper studies a stochastic multiperiod location-transportation problem (SMLTP) characterized by multiple transportation options, multiple demand periods, and a stochastic demand. We consider the determination of the number and location of the depots required to satisfy customer demand as...

  • Probabilistic Sales-Delivery Man and Sales-Delivery Facility Location Problems on a Tree. Averbakh, Igor; Berman, Oded // Transportation Science;May95, Vol. 29 Issue 2, p184 

    Suppose that customers situated at nodes of a network generate calls for service with known probabilities. There is a server, who must perform a service tour that includes all customers requiring service. The order of providing service to customers for each potential list of calls is uniquely...

  • The Period Vehicle Routing Problem with Service Choice.  // Transportation Science;Nov2006, Vol. 40 Issue 4, p439 

    The period vehicle routing problem (PVRP) is a variation of the classic vehicle routing problem in which delivery routes are constructed for a period of time (for example, multiple days). In this paper, we consider a variation of the PVRP in which service frequency is a decision of the model. We...

Share

Read the Article

Courtesy of VIRGINIA BEACH PUBLIC LIBRARY AND SYSTEM

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics