Energy Minimizing Vehicle Routing Problem

This paper proposes a new cost function based on distance and load of the vehicle for the Capacitated Vehicle Routing Problem. The vehicle-routing problem with this new load-based cost objective is called the Energy Minimizing Vehicle Routing Problem (EMVRP). Integer linear programming formulations with O(n2) binary variables and O(n2) constraints are developed for the collection and delivery cases, separately. The proposed models are tested and illustrated by classical Capacitated Vehicle Routing Problem (CVRP) instances from the literature using CPLEX 8.0.

[1]  L. Gouveia.  A result on projection for the vehicle routing ptoblem , 1995 .

[2]  Lawrence Bodin,et al.  Twenty Years of Routing and Scheduling , 1990, Oper. Res..

[3]  Roberto Baldacci,et al.  An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation , 2004, Oper. Res..

[4]  Bruce L. Golden,et al.  VEHICLE ROUTING: METHODS AND STUDIES , 1988 .

[5]  Paolo Toth,et al.  An Overview of Vehicle Routing Problems , 2002, The Vehicle Routing Problem.

[6]  Juan José Salazar González,et al.  Projection results for vehicle routing , 2005, Math. Program..

[7]  Lucio Bianco,et al.  The traveling salesman problem with cumulative costs , 1993, Networks.

[8]  K. Walker.  Applied mechanics for engineering technology , 1974 .

[9]  S. Voß,et al.  A classification of formulations for the (time-dependent) traveling salesman problem , 1995 .

[10]  Abilio Lucena,et al.  Time-dependent traveling salesman problem-the deliveryman case , 1990, Networks.

[11]  John N. Tsitsiklis,et al.  Special cases of traveling salesman and repairman problems with time windows , 1992, Networks.

[12]  Paolo Toth,et al.  Models, relaxations and exact approaches for the capacitated vehicle routing problem , 2002, Discret. Appl. Math..

[13]  Gilbert Laporte,et al.  A Tabu Search Heuristic for the Vehicle Routing Problem , 1991 .

[14]  George L. Nemhauser,et al.  Handbooks in operations research and management science , 1989 .

[15]  Hande Yaman.  Formulations and Valid Inequalities for the Heterogeneous Vehicle Routing Problem , 2006, Math. Program..

[16]  J. F. Pierce,et al.  ON THE TRUCK DISPATCHING PROBLEM , 1971 .

[17]  Paolo Toth,et al.  The Granular Tabu Search and Its Application to the Vehicle-Routing Problem , 2003, INFORMS J. Comput..

[18]  Jan Karel Lenstra,et al.  A classification scheme for vehicle routing and scheduling problems , 1990 .

[19]  Gilbert Laporte,et al.  The vehicle routing problem: An overview of exact and approximate algorithms , 1992 .

[20]  Gilbert Laporte,et al.  Routing problems: A bibliography , 1995, Ann. Oper. Res..