Skip to main content
Top
Published in: Wireless Personal Communications 2/2020

26-10-2019

The New Methodology for Long-Haul Time Dependent Vehicular Network

Author: Krittika Kantawong

Published in: Wireless Personal Communications | Issue 2/2020

Log in

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

This work aims to propose a new methodology for the vehicular network. In this work, long-haul transportation with time dependent is investigated. The fuzzy technique, local search method and greedy selection method are combined into the artificial bee colony algorithm. Effective customers’ location networks are constructed in order to minimize the overall distance. The proposed algorithm is tested on the dataset which customer service times are wide and serviced by the vast vehicles. The results from the proposed algorithm are shown in comparison with other algorithms in the literature. The findings from the computational results are very encouraging, it shows that the algorithm is very competitive to the best solution for all testing problem instances.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literature
2.
go back to reference Toth, P., & Vigo, D. (Eds.). (2002). The vehicle routing problem. Society for Industrial and Applied Mathematics. Toth, P., & Vigo, D. (Eds.). (2002). The vehicle routing problem. Society for Industrial and Applied Mathematics.
3.
go back to reference Crevier, B., Cordeau, J. F., & Laporte, G. (2007). The multi-depot vehicle routing problem with inter-depot routes. European Journal of Operational Research,176(2), 756–773.MathSciNetCrossRef Crevier, B., Cordeau, J. F., & Laporte, G. (2007). The multi-depot vehicle routing problem with inter-depot routes. European Journal of Operational Research,176(2), 756–773.MathSciNetCrossRef
4.
go back to reference Bräysy, O., & Gendreau, M. (2005). Vehicle routing problem with time windows, Part I: Route construction and local search algorithms. Transportation science,39(1), 104–118.CrossRef Bräysy, O., & Gendreau, M. (2005). Vehicle routing problem with time windows, Part I: Route construction and local search algorithms. Transportation science,39(1), 104–118.CrossRef
5.
go back to reference Gendreau, M., & Tarantilis, C. D. (2010). Solving large-scale vehicle routing problems with time windows: The state-of-the-art. Montreal: Cirrelt. Gendreau, M., & Tarantilis, C. D. (2010). Solving large-scale vehicle routing problems with time windows: The state-of-the-art. Montreal: Cirrelt.
6.
go back to reference Kantawong, K. (2017). Multi-phase method for geographical transportation. International Journal of Geoinformatics,13(3), 37–49. Kantawong, K. (2017). Multi-phase method for geographical transportation. International Journal of Geoinformatics,13(3), 37–49.
7.
go back to reference Crainic, T. G. (2003). Long-haul freight transportation. In Handbook of transportation science (pp. 451–516). Springer, Boston, MA. Crainic, T. G. (2003). Long-haul freight transportation. In Handbook of transportation science (pp. 451–516). Springer, Boston, MA.
8.
go back to reference Caramia, M., & Guerriero, F. (2009). A heuristic approach to long-haul freight transportation with multiple objective functions. Omega, 37(3), 600–614.CrossRef Caramia, M., & Guerriero, F. (2009). A heuristic approach to long-haul freight transportation with multiple objective functions. Omega, 37(3), 600–614.CrossRef
9.
go back to reference Sicilia, J. A., Royo, B., Larrodé, E., & Fraile, A. (2014). A decision support system for a long-distance routing problem based on the ant colony optimization metaheuristic. Procedia-Social and Behavioral Sciences,111, 1035–1044.CrossRef Sicilia, J. A., Royo, B., Larrodé, E., & Fraile, A. (2014). A decision support system for a long-distance routing problem based on the ant colony optimization metaheuristic. Procedia-Social and Behavioral Sciences,111, 1035–1044.CrossRef
10.
go back to reference Neves-Moreira, F., Amorim, P., Guimarães, L., & Almada-Lobo, B. (2016). A long-haul freight transportation problem: Synchronizing resources to deliver requests passing through multiple transshipment locations. European Journal of Operational Research,248(2), 487–506.MathSciNetCrossRef Neves-Moreira, F., Amorim, P., Guimarães, L., & Almada-Lobo, B. (2016). A long-haul freight transportation problem: Synchronizing resources to deliver requests passing through multiple transshipment locations. European Journal of Operational Research,248(2), 487–506.MathSciNetCrossRef
11.
go back to reference Kilby, P., & Urli, T. (2016). Fleet design optimisation from historical data using constraint programming and large neighbourhood search. Constraints,21(1), 2–21.MathSciNetCrossRef Kilby, P., & Urli, T. (2016). Fleet design optimisation from historical data using constraint programming and large neighbourhood search. Constraints,21(1), 2–21.MathSciNetCrossRef
12.
go back to reference Rancourt, M. E., Cordeau, J. F., & Laporte, G. (2013). Long-haul vehicle routing and scheduling with working hour rules. Transportation Science,47(1), 81–107.CrossRef Rancourt, M. E., Cordeau, J. F., & Laporte, G. (2013). Long-haul vehicle routing and scheduling with working hour rules. Transportation Science,47(1), 81–107.CrossRef
13.
go back to reference Karaboga, D. (2005). An idea based on honey bee swarm for numerical optimization (Vol. 200, pp. 1–10). Köşk: Technical report-tr06, Erciyes University, Engineering Faculty, Computer Engineering Department. Karaboga, D. (2005). An idea based on honey bee swarm for numerical optimization (Vol. 200, pp. 1–10). Köşk: Technical report-tr06, Erciyes University, Engineering Faculty, Computer Engineering Department.
14.
go back to reference Akay, B., & Karaboga, D. (2012). A modified artificial bee colony algorithm for real-parameter optimization. Information Sciences,192, 120–142.CrossRef Akay, B., & Karaboga, D. (2012). A modified artificial bee colony algorithm for real-parameter optimization. Information Sciences,192, 120–142.CrossRef
15.
go back to reference Yu, B., Yang, Z. Z., & Yao, B. Z. (2011). A hybrid algorithm for vehicle routing problem with time windows. Expert Systems with Applications,38(1), 435–441.CrossRef Yu, B., Yang, Z. Z., & Yao, B. Z. (2011). A hybrid algorithm for vehicle routing problem with time windows. Expert Systems with Applications,38(1), 435–441.CrossRef
16.
go back to reference Thangiah, S. (1995). Vehicle routing problem with time windows using genetic algorithms. Application handbook of Genetic Algorithms: New Frontiers, II, 253–277. Thangiah, S. (1995). Vehicle routing problem with time windows using genetic algorithms. Application handbook of Genetic Algorithms: New Frontiers, II, 253–277.
17.
go back to reference Potvin, J. Y., & Bengio, S. (1996). The vehicle routing problem with time windows part II: genetic search. INFORMS journal on Computing, 8(2), 165–172.CrossRef Potvin, J. Y., & Bengio, S. (1996). The vehicle routing problem with time windows part II: genetic search. INFORMS journal on Computing, 8(2), 165–172.CrossRef
18.
go back to reference Berger, J., Salois, M., & Begin, R. (1998, June). A hybrid genetic algorithm for the vehicle routing problem with time windows. In Conference of the canadian society for computational studies of intelligence (pp. 114–127). Springer, Berlin, Heidelberg. Berger, J., Salois, M., & Begin, R. (1998, June). A hybrid genetic algorithm for the vehicle routing problem with time windows. In Conference of the canadian society for computational studies of intelligence (pp. 114–127). Springer, Berlin, Heidelberg.
19.
go back to reference Bräysy, O., & Gendreau, M. (2001). Genetic algorithms for the vehicle routing problem with time windows. Arpakannus,1, 33–38. Bräysy, O., & Gendreau, M. (2001). Genetic algorithms for the vehicle routing problem with time windows. Arpakannus,1, 33–38.
20.
go back to reference Homberger, J., & Gehring, H. (1999). Two evolutionary metaheuristics for the vehicle routing problem with time windows. INFOR: Information Systems and Operational Research,37(3), 297–318. Homberger, J., & Gehring, H. (1999). Two evolutionary metaheuristics for the vehicle routing problem with time windows. INFOR: Information Systems and Operational Research,37(3), 297–318.
21.
go back to reference Bräysy, O., Berger, J., & Barkaoui, M. (2000). A new hybrid evolutionary algorithm for the vehicle routing problem with time windows. In Route 2000 Workshop, Skodsborg, Denmark. Bräysy, O., Berger, J., & Barkaoui, M. (2000). A new hybrid evolutionary algorithm for the vehicle routing problem with time windows. In Route 2000 Workshop, Skodsborg, Denmark.
22.
go back to reference Gambardella, L. M., Taillard, É., & Agazzi, G. (1999). Macs-vrptw: A multiple colony system for vehicle routing problems with time windows. In New ideas in optimization. Gambardella, L. M., Taillard, É., & Agazzi, G. (1999). Macs-vrptw: A multiple colony system for vehicle routing problems with time windows. In New ideas in optimization.
23.
go back to reference Cordeau, J. F., Laporte, G., & Mercier, A. (2001). A unified tabu search heuristic for vehicle routing problems with time windows. Journal of the Operational research society, 52(8), 928–936.CrossRef Cordeau, J. F., Laporte, G., & Mercier, A. (2001). A unified tabu search heuristic for vehicle routing problems with time windows. Journal of the Operational research society, 52(8), 928–936.CrossRef
Metadata
Title
The New Methodology for Long-Haul Time Dependent Vehicular Network
Author
Krittika Kantawong
Publication date
26-10-2019
Publisher
Springer US
Published in
Wireless Personal Communications / Issue 2/2020
Print ISSN: 0929-6212
Electronic ISSN: 1572-834X
DOI
https://doi.org/10.1007/s11277-019-06883-0

Other articles of this Issue 2/2020

Wireless Personal Communications 2/2020 Go to the issue