An extended Model for multi-objective vehicle routing problem with time windows and multiple demands

Abstract

The vehicle routing problem is the fundamental problem in distribution management, and in general it includes a set of problems in which a number of vehicles located in one or many depots should meet and service to a set of customers, each requiring a certain amount of demands. On the other hand, in most real world problems especially in logistics area we face multi-objective problems. When looking for objectives, often objectives counteract and this is why considering multi-objective problem can be efficient. In the competitive world there is a lot of attention to customer satisfaction. Therefore, we should attempt to provide models that consider more needs of customers. One of the most important factors for customers is providing the request timely. In this study, customers have multiple demands; therefore a new mixed integer programming model for vehicle routing is presented by combining concepts of time windows and multiple demands, and with two objectives: minimizing total travel cost and maximizing demand coverage. Some of the generated instances are solved by GAMS software to evaluate the new proposed model.

Keywords

References

[1] ­Dantzig G.B., Ramser J.M. , “The truck dispatching problem”, Management Science, vol. 6, pp. 81–91, 1959.
[2] ­Cordeau J.F., Laprate G., “Vehicle routing”, Cote Catherine montereal Canada, 2005.
[3] ­El-Sherbeny N. A., “Vehicle routing with time windows: An overview of exact, heuristic and metaheuristic methods”, Journal of King Saud University (Science), vol. 22, pp.123–131, 2010.
[4] ­Sessomboon W., Watanabe K., Irohara T. and Yoshimoto K., “A study on multi-objective vehicle routing problem considering customer satisfaction with due-time (the creation of Pareto optimal solutions by hybrid genetic algorithm)”, Transaction of the Japan Society of Mechanical Engineering, 1998.
[5] ­Hong S-C., Park Y-B., “A heuristic for a bi-objective vehicle routing with time window constraints”, International Journal of Production Economics, vol. 62, pp. 249–258, 1999.
[6] ­El-Sherbeny N., “Resolution of a vehicle routing problem with multi-objective simulated annealing method”, Ph.D. thesis, Faculte Polytechnique de Mons, Mons, Belgique, 2001.
[7] Fan J., “The vehicle routing problem with simultaneous pickup and delively based on customer satisfaction”, Procedia Engineering, Vol. 15, pp.5284-5289, 2011.
[8] ­Tavakkoli-Moghaddam R., Gazanfari M., Alinaghianb M., Salamatbakhsh A. and Norouzi N., “A new mathematical model for a competitive vehicle routing problem with time windows solved by simulated annealing”, Journal of Manufacturing Systems, vol. 30, pp. 83– 92, 2011.
[9] ­Ghoseiri K. and Ghannadpour S.F., “Multi-objective vehicle routing problem with time windows using goal programming and genetic algorithm”, Applied Soft Computing, vol. 10, pp.1096–1107, 2010.
[10] ­Feillet D., Dejax P., Gendreau M. , “Traveling salesman problems with profits”, Transportation Science, vol. 36, pp. 188–20­­5­­­, 2005.
[11] ­Coello Coello C.A., Van Veldhuizen D.A., Lamont G.B. (Eds.), “Evolutionary Algorithms for Solving Multi-objective Problems”, Kluwer Academic Press, 2002.
[12] Deb K., “Multi-objective Optimization using Evolutionary Algorithms”, John Wiley and Sons, 2001.
[13] ­Geoffrion A., “Proper efficiency and theory of vector maximization”, Journal of Mathematical Analysis and Applications, vol. 22, pp. 618–630, 1968.
[14] ­Jozefowiez N., Semet F., Talbi E-G., “Applications of multi-objective evolutionary algorithm”, Advance in Natural Computation, chapter: A multi-objective evolutionary algorithm for the covering tour problem, vol. 1, pp. 247–267, 2004.
[15] ­Pacheco J., Marti R., “Tabu search for a multi-objective routing problem”, Journal of the Operational Research Society, vol. 57, pp. 29–37, 2006.

Files

History

  • Receive Date: 24 October 2012
  • Revise Date: 25 November 2012
  • Accept Date: 09 December 2012

Share

How to cite

Statistics