AUTHORS: Ludovica Adacher

Download as PDF

ABSTRACT: The management of goods delivery is becoming very important. The on time delivery is a critical criterion taking into account customers point of view. But the delivery company must also pay attention to the economic considerations. There are many variations on this issue, but all of them are of great computational complexity. It means that the exact solutions are unavailable for large size problem. The paper proposes the Surrogate Method for the Dynamic Vehicle Routing Problem (DVRP). The aim of DVRP is to find a set of routes to serve multiple customers while the travelling time between point to point may vary during the process. The aim is to schedule the vehicle routes minimizing the number of the required vehicles and the completion time. The presented approach uses some common assumptions but different optimization method. Finally, the proposed heuristic is compared with the genetic algorithm.prepare their manuscripts for WSEAS proceedings or journals by means of LaTeX. You will find the format you have to choose, fonts, how to type the title of your paper, the titles of sections, examples of definitions, lemmas, theorems, equations etc

KEYWORDS: Delivery problem, vehicle routing problem, heuristics.

REFERENCES:

[1]. Adacher L, Oliva G., Pascucci F. (2014). Decentralized route guidance architectures with user preferences in urban transportation networks Procedia - Social and Behavioral Sciences, 111 (5), pp. 1054-1062.

[2]. Bentner, J., Bauer, G., Obermair, G.M., Morgenstern, I., Schneider,2001. J.: Optimization of the time-dependent traveling salesman problem with Monte Carlo methods. Phys. Rev. E 64, 036701.

[3]. Beraldi P, Bruni ME, Lagana D, Musmanno R (2015) The mixed capacitated general routing problem under uncertainty. Eur J Oper Res 240(2):382392

[4]. Beheshti, A. K., Hejazi, S. R., Alinaghian, M. (2015) The vehicle routing problem with multiple prioritized time windows : A case study, Computers Industrial Engineering (90), 402-413.

[5]. Bront JJM (2012). Integer Programming approaches to the Time Dependent Travelling Salesman Problem. PhD thesis, Universidad de Buenos Aires,

[6]. Christiansen CH, Lysgaard J, Whlk S (2009) A branch-and-price algorithm for the capacitated arc routing problem with stochastic demands. Oper Res Lett 37(6):392398

[7]. Furini F, Persiani C, and Toth P, 2015. The Time Dependent Traveling Salesman Planning Problem in Controlled Airspace. Transportation Research Part E.

[8]. Figliozzi M, 2012. The time dependent vehicle routing problem with time windows: Benchmark problems, an efficient solution algorithm, and solution characteristics. Transportation Research Part E Logistics and Transportation Review, 48:616636.

[9]. Fleury G, Lacomme P, Prins C, Randame-Chrif W (2002) Robustness evaluation of solutions for the capacitated arc routing problem. In: Barros FJ, Gambiasi N (eds) AI. Simulation and planning in high autonomy systems, Lisbon

[10]. Gendreau M, Laporte G, Sguin R (1996) Stochastic vehicle routing. Eur J Oper Res 88(1):312

[11]. Golden BL, Magnanti TL, Nguyen HQ (1977) Implementing vehicle routing algorithms. Networks 7(2):113148

[12]. Gmez A, Mario R, Akhavan-Tabatabaei R, Medaglia AL, Mendoza JE (2016) On modeling stochastic travel and service times in vehicle routing. Transp Sci 50(2):627641

[13]. Goodson JC (2015) A priori policy evaluation and cyclic-order-based simulated annealing for the multi-compartment vehicle routing problem with stochastic demands. Eur J Oper Res 241(2):361369

[14]. Gounaris CE, Wiesemann W, Floudas CA (2013) The robust capacitated vehicle routing problem under demand uncertainty. Oper Res 61(3):677693

[15]. Haugland D, Ho SC, Laporte G (2007) Designing delivery districts for the vehicle routing problem with stochastic demands. Eur J Oper Res 180(3):9971010

[16]. Hjorring C, Holt J (1999) New optimality cuts for a single-vehicle stochastic routing problem. Ann Oper Res 86:569584

[17]. Hoff A, Andersson H, Christiansen M, Hasle G, Lkketangen A (2010) Industrial aspects and literature survey: fleet composition and routing. Comput Oper Res 37(12):20412061

[18]. Ichoua, S., Gendreau, M. and Potvin, J.Y. (2003) Vehicle Dispatching with Time-Dependent Travel Times. European Journal of Operational Research, 144, 379-396.

[19]. Laporte G, Musmanno R, Vocaturo F (2010) An adaptive large neighbourhood search heuristic for the capacitated arc-routing problem with stochastic demands. Transp Sci 44(1):125135

[20]. Marinakis Y, Iordanidou G-R, Marinaki M (2013) Particle swarm optimization for the vehicle routing problem with stochastic demands. Appl Soft Comput 13(4):16931704

[21]. Mendoza J, Rousseau L-M, Villegas J (2015) A hybrid metaheuristic for the vehicle routing problem with stochastic demand and duration constraints. J Heuristics, pp 128

[22]. Mrwczyska, B., Ciela, M. (2017). Planning routes of vans in a catering company. ICLEEE 2017 International Conference of Logistic, Economics and Environmental Engineering. Maribor, Slovenia : 66 - 70, ISBN 978-961-6672-11-5

[23]. Montoya-Torres, J. R., Franco, J. L., Isaza, S. N., Jimnez, H. F., and Herazo-Padilla, N. (2015). A literature review on the vehicle routing problem with multiple depots. Computers Industrial Engineering, 79:115129

[24]. Park, Y. B. (2000). A solution of the bicriteria vehicle scheduling problemswith time and areadependent travel speeds. Computers and Industrial Engineering, 38 (1), 173187.

[25]. Pillac, V., Gueret, C., Medaglia, A. L. (2013). A parallel matheuristic for the technicianrouting and scheduling problem.Optimization Letters,7, 15251535.

[26]. Wassan N and Nagy G, 2014.Vehicle Routing Problem with Deliveries and Pickups: Modelling Issues and Meta-heuristics Solution Approaches International Journal of Transportation Vol.2, No.1 (2014), pp.95-110.

[27]. Zhang T, Chaovalitwongse W, Zhang Y (2012) Scatter search for the stochastic travel-time vehicle routing problem with simultaneous pick-ups and deliveries. Comput Oper Res 39(10):22772290

[28].Zhu L, Rousseau L-M, Rei W, Li B (2014) Paired cooperative reoptimization strategy for the vehicle routing problem with stochastic demands. Comput Oper Res 50:113