Skip to main content
Disciplines
Automotive Business IT + Informatics Construction + Real Estate Electrical Engineering + Electronics Energy + Sustainability Insurance + Risk Finance + Banking Management + Leadership Marketing + Sales Mechanical Engineering + Materials
Events
DE
EN
Books
Journals
Topic Page
Marketing
Start single access now
Access for companies
EXTENDED SEARCH
Log in
Top
Published in:
Advances in Core Computer Science-Based Technologies Read chapter Read first chapter

2021 | OriginalPaper | Chapter

15. Computational Intelligence and Combinatorial Optimization Problems in Transportation Science

Authors : Manolis N. Kritikos, Pantelis Z. Lappas

Published in: Advances in Core Computer Science-Based Technologies

Publisher: Springer International Publishing

Log in

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

search-config
loading …

Abstract

The purpose of this chapter is to highlight the use of computational intelligence algorithms for solving a special class of combinatorial optimization problems in transportation science called routing problems. Classical routing problems, such as the Traveling Salesman Problem and the Vehicle Routing Problem, as well as highly relevant extensions of classical routing problems like Vehicle Routing Problem with Time Windows and Inventory Routing Problem have received a great deal of attention from academics, consultants and practitioners in the field of Supply Chain Management. The contribution of this study is fourfold: (i) it provides a comprehensive review of various solution algorithms that have been proposed in literature as possible solutions to many of the complex issues surrounding routing problem management, (ii) it presents formulation schemes related to basic routing problems and their extensions, (iii) it promotes the use of selected computational algorithms called meta-heuristics and sim-heuristics by providing various graphical presentation formats so as to simplify complicated issues and convey meaningful insights into the routing problems and (iv) it points out interesting research directions for further development in routing problems.

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

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!

inform 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!

inform now

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!

inform now
previous chapter A Fuzzy Task Scheduling Method
next chapter Homeodynamic Modelling of Complex Abnormal Biological Processes
Footnotes
Literature
1.
T. Abdelmaguid, M. Dessouky, A genetic algorithm approach to the integrated inventory-distribution problem. Int. J. Prod. Res. 44(21), 4445–4464 (2006)MATHCrossRef
2.
T. Abdelmaguid, M. Dessouky, F. Ordóñez, Heuristic approaches for the inventory-routing problem with backlogging. Comput. Ind. Eng. 56(4), 1519–1534 (2009)CrossRef
3.
Y. Adulyasak, J.F. Cordeau, R. Jans, The production routing problem: a review of formulations and solution algorithms. Comput. Oper. Res. 55, 141–152 (2015)
4.
Y. Agarwal, K. Mathur, M. Salkin, A set-partitioning-based exact algorithm for the vehicle routing problem. Networks 19(7), 731–749 (1989)MathSciNetMATHCrossRef
5.
A. Agra, M. Christiansen, A. Delgado, L.M. Hvattum, A maritime inventory routing problem with stochastic sailing and port times. Comput. Oper. Res. 61, 18–30 (2015)MathSciNetMATHCrossRef
6.
A. Agra, M. Christiansen, A. Delgado, L. Simonetti, Hybrid heuristics for a short sea inventory routing problem. Eur. J. Oper. Res. 236(3), 924–935 (2014)MathSciNetMATHCrossRef
7.
T.J. Ai, V. Kachitvichyanukul, A particle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery. Comput. Oper. Res. 36(5), 1693–1702 (2009)MATHCrossRef
8.
M. Akhbari, Y. Mehrjerdi, H. Zare, A. Makui, VMI-type supply chains: a brief review. J. Optim. Ind. Eng. 7(14), 75–87 (2014)
9.
10.
D. Aksen, O. Kaya, F.S. Salman, Ö. Tüncelb, An adaptive large neighborhood search algorithm for a selective and periodic inventory routing problem. Eur. J. Oper. Res. 239(2), 413–426 (2014)MathSciNetMATHCrossRef
11.
H. Andersson, M. Christiansen, G. Desaulniers, A new decomposition algorithm for a liquefied natural gas inventory routing problem. Int. J. Prod. Res. 54(2), 564–578 (2016)CrossRef
12.
R. Angel, W. Caudle, R. Noonan, A. Whinston, Computer assisted school bus scheduling. Manag. Sci. 18(6), 279–288 (1972)CrossRef
13.
D. Applegate, R. Bixby, V. Chvátal, W. Cook, The Traveling Salesman Problem: A Computational Study (Princeton University Press, New Jersey, 2006)MATH
14.
D. Applegate, R. Bixby, V. Chvátal, W. Cook, Implementing the Dantzig-Fulkerson-Johnson algorithm for large scale traveling salesman problems. Math. Program. 97(1–2), 91–153 (2003)MathSciNetMATHCrossRef
15.
C. Archetti, L. Bertazzi, A. Hertz, M.G. Speranza, A hybrid heuristic for an inventory routing problem. INFORMS J. Comput. 24(1), 101–116 (2012)MathSciNetMATHCrossRef
16.
C. Archetti, L. Bertazzi, G. Laporte, M.G. Speranza, A branch-and-cut algorithm for a vendor-managed inventory-routing problem. Transp. Sci. 41(3), 382–391 (2007)CrossRef
17.
C. Archetti, N. Boland, M.G. Speranza, A matheuristic for the multivehicle routing problem. INFORMS J. Comput. 29(3), 377–387 (2017)MathSciNetMATHCrossRef
18.
P. Avella, M. Boccia, A. Sforza, Solving a fuel delivery problem by heuristic and exact approaches. Eur. J. Oper. Res. 152(1), 170–179 (2004)MathSciNetMATHCrossRef
19.
N.A.B. Aziz, N.H. Moin, Genetic algorithm based approach for the multi product multi period inventory routing problem. Paper presented at the proceedings of 2007 IEEE international conference on industrial engineering and engineering management (Asia, Singapore, 2007), pp. 1619–1623
20.
21.
E. Baker, J. Schaffer, Solution improvement heuristics for the vehicle routing and scheduling problem with time windows constraints. Am. J. Math. Manag. Sci. 6(3–4), 261–300 (1989)MATH
22.
N. Balakrishnan, Simple heuristics for the vehicle routeing problem with soft time windows. J. Oper. Res. Soc. 44(3), 279–287 (1993)MATHCrossRef
23.
R. Baldacci, N. Christofides, A. Mingozzi, An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts. Math. Program. 115(2), 351–385 (2008)MathSciNetMATHCrossRef
24.
R. Baldacci, E. Hadjiconstantinou, A. Mingozzi, An exact algorithm for the capacitated vehicle routing problem based on a two-commodity network flow formulation. Oper. Res. 52(5), 723–738 (2004)MathSciNetMATHCrossRef
25.
R. Baldacci, A. Mingozzi, A unified exact method for solving different classes of vehicle routing problems. Math. Program. 120–347 (2009)
26.
27.
J. Beasley, Route first-cluster secosnd methods for vehicle routing. Omega 11(4), 403–408 (1983)CrossRef
28.
T. Bektaş, The multiple traveling salesman problem: an overview of formulations and solution procedures. Omega 34(3), 209–219 (2006)MathSciNetCrossRef
29.
T. Bektaş, G. Laporte, The pollution-routing problem. Transp. Res. Part B: Methodol. 45(8), 1232–1250 (2011)CrossRef
30.
L. Bertazzi, A. Bosco, F. Guerriero, D. Laganà, A stochastic inventory routing problem with stock-out. Transp. Res. Part C: Emerg. Technol. 27, 89–107 (2013)CrossRef
31.
L. Bertazzi, A. Bosco, D. Laganà, Managing stochastic demand in an inventory routing problem with transportation procurement. Omega 56, 112–121 (2015)CrossRef
32.
L. Bertazzi, L. Coelho, A. Maio, D. Laganà, A matheuristic algorithm for the multi-depot inventory routing problem. Transp. Res. Part E: Logist. Transp. Rev. 122, 524–544 (2019)CrossRef
33.
L. Bertazzi, M. Savelsbergh, G. Speranza, Inventory routing, in The Vehicle Routing Problem: Latest Advances and New Challenges, ed. by B. Golden, S. Raghavan, E. Wasil (Springer, New York, 2008), pp. 49–72MATHCrossRef
34.
M. Boudia, C. Prins, A memetic algorithm with dynamic population management for an integrated production-distribution problem. Eur. J. Oper. Res. 195(3), 703–715 (2009)MATHCrossRef
35.
O. Bräysy, Fast local searches for the vehicle routing problem with time windows. INFOR: Inf. Syst. Oper. Res. 40(4), 319–330 (2003)
36.
A. Campbell, L. Clarke, A. Kleywegt, M. Savelsbergh, The inventory routing problem, in Fleet Management and Logisticsi, ed. by T. Crainic, G. Laporte (Springer, Berlin, 1998), pp. 95–113CrossRef
37.
A. Campbell, L. Clarke, M. Savelsebergh, in The Vehicle Routing Problem, ed. by P. Toth, D. Vigo (SIAM, Philadelphia, 2002), pp. 53–81
38.
D.S. Chen, R. Batson, Y. Dang, Applied Integer Programming: Modeling and Solution (Willey, New Jersey, 2010)MATH
39.
A.L. Chen, G. Yang, Z. Wu, Hybrid discrete particle swarm optimization algorithm for capacitated vehicle routing problem. J. Zhejiang Univ.—Sci. A 7(4), 607–614 (2006)
40.
C. Cheng, P. Yang, M. Qi, L.M. Rousseau, Modeling a green inventory routing problem with a heterogeneous fleet. Transp. Res. Part E: Logist. Transp. Rev. 97, 97–112 (2017)CrossRef
41.
W.C. Chiang, R. Russell, Integrating purchasing and routing in a propane gas supply chain. Eur. J. Oper. Res. 154(3), 710–729 (2004)MATHCrossRef
42.
W.C. Chiang, R. Russell, Simulated annealing metaheuristics for the vehicle routing problem with time windows. Ann. Oper. Res. 63(1), 3–27 (1996)MATHCrossRef
43.
W.D. Cho, Y.H. Lee, Y.T. Lee, M. Gen, An adaptive genetic algorithm for the time dependent inventory routing problem. J. Intell. Manuf. 25(5), 1025–1042 (2013)CrossRef
44.
45.
46.
N. Christofides, S. Eilon, An algorithm for the vehicle dispatching problem. J. Oper. Res. Soc. 20(3), 309–318 (1969)CrossRef
47.
N. Christofides, A. Mingozzi, P. Toth, Exact algorithms for the vehicle routing problem, based on spanning tree shortest path relaxations. Math. Program. 20(1), 255–282 (1981)MathSciNetMATHCrossRef
48.
N. Christofides, A. Mingozzi, P. Toth, Space state relaxation procedures for the computation of bounds to routing problems. Networks 11(2), 145–164 (1981)MathSciNetMATHCrossRef
49.
G. Clarke, J. Wright, Scheduling of vehicles from a central depot to a number of delivery points. Oper. Res. 12(4), 568–581 (1964)CrossRef
50.
J.M. Clochard, D. Naddef, Using path inequalities in a branch and cut code for the symmetric traveling salesman problem. Paper presented at the proceedings of the 3rd IPCO conference (Italy, Erice, 29 April—1 May 1993), pp. 291–311
51.
L. Coelho, J.F. Cordeau, G. Laporte, The inventory-routing problem with transhipment. Comput. Oper. Res. 39(11), 2537–2548 (2012)MathSciNetMATHCrossRef
52.
L. Coelho, J.F. Cordeau, G. Laporte, Consistency in multi-vehicle inventory-routing. Transp. Res. Part C: Emerg. Technol. 24, 270–287 (2012)CrossRef
53.
L. Coelho, G. Laporte, A branch-and-cut algorithm for the multi-product multi-vehicle inventory-routing problem. Int. J. Prod. Res. 51(23–24), 7156–7169 (2013)CrossRef
54.
L. Coelho, G. Laporte, The exact solution of several classes of inventory-routing problems. Comput. Oper. Res. 40(2), 558–565 (2013)MathSciNetMATHCrossRef
55.
56.
57.
M. Desrochers, J. Desrosiers, M. Solomon, A new optimization algorithm for the vehicle routing problem with time windows. Oper. Res. 40(2), 342–354 (1992)MathSciNetMATHCrossRef
58.
J. Desrosiers, F. Soumis, M. Desrochers, Routing with time windows by column generation. Networks 14(4), 545–565 (1984)MATHCrossRef
59.
A. Diabat, T. Abdallah, T. Le, A hybrid tabu search based heuristic for the periodic distribution inventory problem with perishable goods. Ann. Oper. Res. 242(2), 373–398 (2016)MathSciNetMATHCrossRef
60.
B. Escario, J. Jimenez, J. Giron-Sierra, Ant colony extended: Experiments on traveling salesman problem. Expert. Syst. Appl. 42(1), 390–410 (2015)
61.
A. Federgruen, G. Prastacos, P.H. Zipkin, An allocation and distribution model for perishable products. Oper. Res. 34(1), 75–82 (1986)MATHCrossRef
62.
63.
64.
65.
M. Fisher, K. Jornsteen, O. Madsen, Vehicle routing with time windows: two optimization algorithms. Oper. Res. 45(3), 488–492 (1997)MathSciNetMATHCrossRef
66.
67.
R. Fukasawa, H. Longo, J. Lysgaard, M. Aragão, M. Reis, E. Uchoa, R. Werneck, Robust branch-and-cut-and-price for the capacitated vehicle routing problem. Math. Program. 106(3), 491–511 (2006)MathSciNetMATHCrossRef
68.
V. Gaur, M.L. Fisher, A periodic inventory routing problem at a supermarket chain. Oper. Res. 52(6), 813–822 (2004)MATHCrossRef
69.
B. Gavish, K. Strikanth, An optimal solution method for large-scale multiple traveling salesman problems. Oper. Res. 34(5), 698–717 (1986)MathSciNetMATHCrossRef
70.
M. Gendreau, A. Hertz, G. Laporte, A tabu search heuristic for the vehicle routing problem. Manag. Sci. 40(10), 1276–1290 (1994)MATHCrossRef
71.
X. Geng, Z. Chen, W. Yang, D. Shi, K. Zhao, Solving the traveling salesman problem based on an adaptive simulated annealing algorithm with greedy search. Appl. Soft Comput. 11(4), 3680–3689 (2011)CrossRef
72.
Y. Ghiami, T. Van Woensel, M. Christiansen, G. Laporte, A combined liquefied natural gas routing and deteriorating inventory management problem, in Computational Logistics, ed. by F. Corman, S. Voβ, R. Negenborn (Springer, Switzerland, 2015), pp. 91–104CrossRef
73.
B. Gillett, L. Miller, A heuristic algorithm for the vehicle dispatch problem. Oper. Res. 22(2), 340–349 (1974)MATHCrossRef
74.
75.
A. Grasas, A. Juan, H. Lourenço, SimILS: a simulation-based extension of the iterated local search metaheuristic for stochastic combinatorial optimization. J. Simul. 10(1), 69–77 (2014)CrossRef
76.
S.E. Griffis, J.E. Bell, D.J. Closs, Metaheuristics in logistics and supply chain management. J. Bus. Logist. 33(2), 90–106 (2012)CrossRef
77.
J. Gromicho, J. Paixão, I. Branco, Exact solution of multiple traveling salesman problems, in Combinatorial Optimization, ed. by M. Akgül, H. Hamacher, S. Tüfekçi (Springer, Berlin, 1992), pp. 291–292CrossRef
78.
O. Guemri, A. Bektar, B. Beldjilali, D. Trentesaux, GRASP-based heuristic algorithm for the multi-vehicle inventory routing problem. 4OR 14(4), 377–404 (2016)
79.
E. Hadjiconstantinou, N. Christofides, A. Mingozzi, A new exact algorithm for the vehicle routing problem based on q-paths and k-shortest paths relaxations. Ann. Oper. Res. 61(1), 21–43 (1995)MathSciNetMATHCrossRef
80.
A. Hemmati, L.M. Hvattum, M. Christiansen, G. Laporte, An iterative two-phase hybrid matheuristic for a multi-product short sea inventory-routing problem. Eur. J. Oper. Res. 252(3), 775–788 (2016)MathSciNetMATHCrossRef
81.
F. Hillier, G. Lieberman, Introduction to Operations Research (McGraw-Hill Education, Singapore, Asia, 2010)
82.
P. Hokama, F.K. Miyazawa, E. Xavier, A branch-and-cut approach for the vehicle routing problem with loading constraints. Expert. Syst. Appl. 47(3), 1–13 (2016)
83.
J. Holland, Adaptation in Natural and Artificial Systems (University of Michigan Press, Ann Arbor, 1975)
84.
S.H. Huang, P.C. Lin, A modified ant colony optimization algorithm for multi-item inventory routing problems with demand uncertainty. Transp. Res. Part E: Logist. Transp. Rev. 46(5), 598–611 (2010)MathSciNetCrossRef
85.
G. Ioannou, M. Kritikos, G. Prastacos, A greedy look-ahead heuristic for the vehicle routing problem with time windows. J. Oper. Res. Soc. 52(5), 523–537 (2001)MATHCrossRef
86.
A. Jabbarzadeh, S.G.J. Naini, H. Davoudpour, N. Azad, Designing a supply chain network under the risk of disruptions. Math. Probl. Eng. 2012, 1–23 (2012)MathSciNetMATHCrossRef
87.
A. Juan, J. Faulin, S. Grasman, M. Rabe, G. Figueira, A review of simheuristics: extending metaheuristics to deal with stochastic combinatorial optimization problems. Oper. Res. Perspect. 2, 62–72 (2015)MathSciNet
88.
A. Juan, J. Faulin, J. Jorba, J. Caceres, J.M. Marques, Using parallel & distributed computing for real-time solving of vehicle routing problems with stochastic demands. Ann. Oper. Res. 207(1), 43–65 (2013)MathSciNetMATHCrossRef
89.
A. Juan, J. Faulin, S. Grasman, D. Riera, J. Marull, C. Mendez, Using safety stocks and simulation to solve the vehicle routing problem with stochastic demands. Transp. Res. Part C: Emerg. Technol. 19(5), 751–765 (2011)CrossRef
90.
A. Juan, S. Grasman, J. Caceres Cruz, T. Bektaş, A simheuristic algorithm for the single-period stochastic inventory-routing problem with stock outs. Simul. Model. Pract. Theory 46, 40–52 (2014)CrossRef
91.
B. Kallehauge, J. Larsen, O. Madsen, Lagrangian duality applied to the vehicle routing problem with time windows. Comput. Oper. Res. 33(5), 1464–1487 (2006)MathSciNetMATHCrossRef
92.
M. Kamarul, I.A. Rahim, Y. Zhong, E. Aghezzaf, T. Aouam, Modelling and solving the multiperiod inventory-routing problem with stochastic stationary demand rates. Int. J. Prod. Res. 52(14), 4351–4363 (2014)CrossRef
93.
M. Keskin, B. Çatay, A matheuristic method for the electric vehicle routing problem with time windows and fast chargers. Comput. Oper. Res. 100, 172–188 (2018)MathSciNetMATHCrossRef
94.
N. Kohl, O. Madsen, An optimization algorithm for the vehicle routing problem with time windows based on Lagrangian relaxation. Oper. Res. 45(3), 395–406 (1997)MathSciNetMATHCrossRef
95.
96.
G. Kontoravdis, J. Bard, A GRASP for the vehicle routing problem with time windows. ORSA J. Comput. 7(1), 10–23 (1995)MATHCrossRef
97.
J. Knox, Tabu search performance on the symmetric traveling salesman problem. Comput. Oper. Res. 21(8), 867–876 (1994)MATHCrossRef
98.
N. Labadi, C. Prins, M. Reghioui, A memetic algorithm for the vehicle routing problem with time windows. RAIRO 42(3), 415–431 (2008)MathSciNetMATHCrossRef
99.
A. Landeghem, A bi-criteria heuristic for the vehicle routing problem with time windows. Eur. J. Oper. Res. 36(2), 217–226 (1988)MATHCrossRef
100.
101.
P. Lappas, M. Kritikos, G. Ioannou, A hybrid evolutionary optimization algorithm for the inventory routing problem. Int. J. Oper. Quant. Manag. 24(2), 75–115 (2018)
102.
P. Lappas, M. Kritikos, G. Ioannou, A two-phase solution algorithm for the inventory routing problem with time windows. J. Math. Syst. Sci. 7(9), 237–247 (2017)
103.
P. Lappas, M. Kritikos, G. Ioannou, A. Burnetas, A combination of Monte-Carlo simulation and a VNS meta-heuristic algorithm for solving the stochastic inventory routing problem with time windows. Paper presented at the proceedings of the international congress on optimization and decision science, Italy, Sorrento, 4–7 September 2017b
104.
V. Leggieri, M. Haouari, A matheuristic for the asymmetric capacitated vehicle routing problem. Discret. Appl. Math. 234, 139–150 (2016)MathSciNetMATHCrossRef
105.
A. Letchford, R. Eglese, J. Lysgaard, Multistars, partial multistars and the capacitated vehicle routing problem. Math. Program. 94(1), 21–40 (2002)MathSciNetMATHCrossRef
106.
K. Li, B. Chen, A. Lyer Sivakumar, Y. Wu, An inventory-routing problem with the objective of travel time minimization. Eur. J. Oper. Res. 236(3), 936–945 (2014)MathSciNetMATHCrossRef
107.
108.
Y.F. Liao, D.H. Yau, C.L. Chen, Evolutionary algorithm to traveling salesman problems. Comput. Math. Appl. 64(5), 788–797 (2012)MATHCrossRef
109.
110.
S. Lin, B. Kernigham, An effective heuristic algorithm for the traveling salesman problem. Oper. Res. 21(2), 498–516 (1973)MathSciNetCrossRef
111.
J. Little, K. Murty, D. Sweeney, C. Karel, An algorithm for the traveling salesman problem. Oper. Res. 11(6), 972–989 (1963)MATHCrossRef
112.
S.C. Liu, W.T. Lee, A Heuristic method for the inventory routing problem with time windows. Expert Syst. Appl. 38(10), 13223–13231 (2011)CrossRef
113.
S.C. Liu, M.C. Lu, C.H. Chung, A hybrid heuristic method for the periodic inventory routing problem. Int. J. Adv. Manuf. Technol. 85(9–12), 2345–2352 (2016)CrossRef
114.
M. López-Ibáñez, C. Blum, J. Ohlmann, B. Thomas, The traveling salesman problem with time windows: Adapting algorithms from travel-time to makespan optimization. Appl. Soft Comput. 13, 3806–3815 (2013)CrossRef
115.
J. Lysgaard, A. Letchford, R. Eglese, A new branch-and-cut algorithm for the capacitated vehicle routing problem. Math. Program. 100(2), 423–445 (2004)MathSciNetMATHCrossRef
116.
V. Maniezzo, T. Stützle, S. Voβ, Matheuristics: Hybridizing Metaheuristics and Mathematical Programming (Springer, New York, 2009)
117.
Y. Marinakis, G.R. Iordanidou, M. Marinaki, Particle swarm optimization for the vehicle routing with stochastic demands. Appl. Soft Comput. 13(4), 1693–1704 (2013)CrossRef
118.
119.
120.
A. Mjirda, B. Jarboui, R. Macedo, S. Hanafi, A variable neighborhood search for the multi-product inventory routing problem. Electron. Notes Discret. Math. 39, 91–98 (2012)MATHCrossRef
121.
A. Mjirda, B. Jarboui, R. Macedo, S. Hanafi, N. Mladenović, A two phase variable neighborhood search for the multi-product inventory routing problem. Comput. Oper. Res. 52, 291–299 (2014)MathSciNetMATHCrossRef
122.
A. Mjirda, B. Jarboui, J. Mladenović, C. Wilbaut, S. Hanafi, A general variable neighborhood search for the multi-product inventory routing problem. IMA J. Manag. Math. 27, 39–54 (2016)MathSciNetMATHCrossRef
123.
124.
N.H. Moin, S. Salhi, N.A.B. Aziz, An efficient hybrid genetic algorithm for the multi-product multi-period inventory routing problem. Int. J. Prod. Econ. 133(1), 334–343 (2011)CrossRef
125.
D. Naddef, Polyhedral theory and branch-and-cut algorithms for the symmetric TSP, in The Traveling Salesman Problem and Its Variations, ed. by G. Gutin, A. Punnen (Springer, New York, 2002), pp. 29–116MATH
126.
D. Naddef, G. Rinaldi, Branch-and-cut algorithms for the capacitated VRP, in The Vehicle Routing Problem, ed. by P. Toth, D. Vigo (SIAM, Philadelphia, 2002), pp. 53–81MATHCrossRef
127.
R. Nambirajan, A. Mendoza, S. Pazhani, T.T. Narendran, K. Ganesh, CARE: heuristics for two-stage multi-product inventory routing problems with replenishments. Comput. Ind. Eng. 97, 41–57 (2016)CrossRef
128.
P. Nolz, N. Absi, D. Feillet, A stochastic inventory routing problem for infectious medical waste collection. Networks 63(1), 82–95 (2014)MathSciNetMATHCrossRef
129.
P. Nolz, N. Absi, D. Feillet, A bi-objective inventory routing problem for sustainable waste management under uncertainty. J. Multi-Criteria Decis. Anal. 21(5–6), 299–314 (2014)MATHCrossRef
130.
M. Padberg, G. Rinaldi, A branch-and-cut algorithm for the resolution of large-scale symmetric travelling salesman problems. SIAM Rev. 33(1), 60–100 (1991)MathSciNetMATHCrossRef
131.
M. Padberg, G. Rinaldi, Optimization of a 532-city symmetric traveling salesman problem by branch and cut. Oper. Res. Lett. 6(1), 1–7 (1987)MathSciNetMATHCrossRef
132.
C. Papadimitriou, K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity (Dover Publications, New York, 1998)MATH
133.
Y.B. Park, J.S. Yoo, H.S. Park, A genetic algorithm for the vendor-managed inventory routing problem with lost sales. Expert Syst. Appl. 53, 149–159 (2016)CrossRef
134.
J. Pekny, D. Miller, A parallel branch and bound algorithm for solving large asymmetric traveling salesman problems. Math. Program. 55(1–3), 17–33 (1992)MathSciNetMATHCrossRef
135.
136.
D. Popović, M. Vidović, G. Radivojević, Variable neighborhood search heuristic for the inventory routing problem in fuel delivery. Expert Syst. Appl. 39(18), 13390–13398 (2012)CrossRef
137.
J.Y. Potvin, Genetic algorithms for the traveling salesman problem. Ann. Oper. Res. 63(3), 337–370 (1996)MATHCrossRef
138.
J.Y. Potvin, G. Lapalme, J. Rousseau, A generalized k-opt exchange procedure for the MTSP. INFOR: Inf. Syst. Oper. Res. 27(4), 474–481 (1989)
139.
J.Y. Potvin, J. Rousseau, An exchange heuristic for routeing problems with time windows. J. Oper. Res. Soc. 46(12), 1433–1446 (1995)MATHCrossRef
140.
J.Y. Potvin, J. Rousseau, A parallel route building algorithm for the vehicle routing and scheduling problem with time windows. Eur. J. Oper. Res. 66(3), 331–340 (1993)MATHCrossRef
141.
C. Prins, A simple and effective evolutionary algorithm for the vehicle routing problem. Comput. Oper. Res. 31(12), 1985–2002 (2004)MathSciNetMATHCrossRef
142.
L. Qin, L. Miao, Q. Ruan, Y. Zhang, A local search method for periodic inventory routing problem. Expert Syst. Appl. 41(2), 765–778 (2014)CrossRef
143.
B. Raa, Fleet optimization for cyclic inventory routing problems. Int. J. Prod. Econ. 160, 172–181 (2015)CrossRef
144.
M. Reimann, K. Doerner, F. Hartl, D-ants: Savings based ants divide and conquer the vehicle routing problem. Comput. Oper. Res. 31(4), 563–591 (2004)MATHCrossRef
145.
D. Rosenkrantz, R. Stearns, P. Lewis, An analysis of several heuristics for the traveling salesman problem. SIAM J. Comput. 6(3), 563–581 (1977)MathSciNetMATHCrossRef
146.
R. Russel, An effective heuristic for the m-tour traveling salesman problem with some side conditions. Oper. Res. 25(3), 517–524 (1977)CrossRef
147.
J. Ryan, T. Bailey, J. Moore, W. Carlton, Reactive tabu search in unmanned aerial reconnaissance simulations. Paper presented at the proceedings of the 1998 winter simulation conference (United States of America, Washington, 13–16 December, 1998), pp. 873–880
148.
G. Schmidt, W. Wilhelm, Strategic, tactical and operational decisions in multi-national logistics networks: A review and discussion of modeling issues. Int. J. Prod. Res. 38(7), 1501–1523 (2000)MATHCrossRef
149.
Q. Shen, F. Chu, H. Chen, A Lagrangian relaxation approach for a multi-mode inventory routing problem with transshipment in crude oil transportation. Comput. Chem. Eng. 35(10), 2113–2123 (2011)CrossRef
150.
V. Shirokikh, V. Zakharov, Dynamic adaptive large neighborhood search for inventory routing problem, in Modeling, Computation and Optimization in Information Systems and Management Sciences, ed. by H.A.L. Thi, T.P. Dinh, N.T. Nguyen (Springer, New York, 2015), pp. 231–241
151.
N. Shukla, M.K. Tiwari, D. Ceglarek, Genetic-algorithms-based algorithm portfolio for inventory routing problem with stochastic demand. Int. J. Prod. Res. 51(1), 118–137 (2013)CrossRef
152.
D. Simić, S. Simić, Evolutionary approach in inventory routing problem, in Advances in Computational Intelligence, ed. by I. Rojas, G. Joya, J. Cabestany (Springer, New York, 2013), pp. 395–403CrossRef
153.
T. Singh, J. Arbogast, N. Neagu, An incremental approach using local-search heuristic for inventory routing problem in industrial gases. Comput. Chem. Eng. 80, 199–210 (2015)CrossRef
154.
M. Solomon, Algorithms for the vehicle routing and scheduling problem with time window constraints. Oper. Res. 35(2), 254–265 (1987)MathSciNetMATHCrossRef
155.
O. Solyali, H. Süral, A branch-and-cut algorithm using a strong formulation and an a priori tour based heuristic for an inventory-routing problem. Transp. Sci. 45(3), 335–345 (2011)CrossRef
156.
J.H. Song, K. Furman, A maritime inventory routing problem: practical approach. Comput. Oper. Res. 40(3), 657–665 (2013)MATHCrossRef
157.
M. Soysal, J. Bloemhof-Ruwaard, R. Haijema, J. Van der Vorst, Modeling a green inventory routing problem for perishable products with horizontal collaboration. Comput. Oper. Res. 89, 168–182 (2016)MathSciNetMATHCrossRef
158.
M. Soysal, J. Bloemhof-Ruwaard, R. Haijema, J. Van der Vorst, Modeling an inventory routing problem for perishable products with environmental considerations and demand uncertainty. Int. J. Prod. Econ. 164, 118–133 (2015)CrossRef
159.
É. Taillard, Parallel iterative search methods for vehicle routing problems. Networks 23(8), 661–673 (1993)MATHCrossRef
160.
É. Taillard, P. Badeau, M. Gendreau, F. Guertin, J.Y. Potvin, A tabu search heuristic for the vehicle routing problem with soft time windows. Transp. Sci. 31(2), 170–186 (1997)MATHCrossRef
161.
K.C. Tan, A framework of supply chain management literature. Eur. J. Purch. Supply Manag. 7(1), 39–48 (2001)CrossRef
162.
V. Tatsis, K. Parsopoulos, K. Skouri, I. Konstantaras, An ant-based optimization approach for inventory routing, in EVOLVE—A Bridge Between Probability, Set Oriented Numerics, and Evolutionary Computation IV, ed. by M. Emmerich, A. Deutz, O. Schütze, T. Bäck, E. Tantar, A. Tantar, P. Moral, P. Legrand, P. Bouvry, C. Coello (Springer, New York, 2013), pp. 107–121CrossRef
163.
P. Toth, D. Vigo, The granular tabu search and its application to the vehicle routing problem. INFORMS J. Comput. 15(4), 333–346 (2003)MathSciNetMATHCrossRef
164.
165.
P. Venkatesh, A. Singh, Two metaheuristic approaches for the multiple traveling salesperson problem. Appl. Soft Comput. 26, 74–89 (2015)CrossRef
166.
T. Volgenant, R. Jonker, A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation. Eur. J. Oper. Res. 9(1), 83–89 (1982)MathSciNetMATHCrossRef
167.
168.
Z. Yang, M. Emmerich, T. Bäck, J. Kok, Multicriteria inventory routing by cooperative swarms and evolutionary algorithms, in Bioinspired computation in artificial systems, ed. by J.M. Ferrández Vicente, J.R. Álvarez- Sánchez, F. de la Paz López, J. Toledo-Moreo, H. Adeli (Springer, New York, 2015), pp. 127–137
169.
M. Zachariasen, M. Dam, Tabu search on the geometric traveling salesman problem, in Meta-Heuristics, ed. by I. Osman, J. Kelly (Springer, Boston, 1996), pp. 571–587CrossRef
170.
W. Zeng, Q. Zhao, Study of stochastic demand inventory routing problem with soft time windows based on MDP, in Advances in Neural Network Research and Applications, ed. by Z. Zeng, J. Wang (Springer, Shanghai, 2010), pp. 193–200CrossRef
171.
S. Zhan, J. Lin, Z. Zhang, Y. Zhong, List-based simulated annealing algorithm for traveling salesman problem. Comput. Intell. Neurosci. 2016, 1–12 (2016)CrossRef
Metadata
Title
Computational Intelligence and Combinatorial Optimization Problems in Transportation Science
Authors
Manolis N. Kritikos
Pantelis Z. Lappas
Copyright Year
2021
Book
Advances in Core Computer Science-Based Technologies

Print ISBN: 978-3-030-41195-4

Electronic ISBN: 978-3-030-41196-1

Copyright Year: 2021

DOI
https://doi.org/10.1007/978-3-030-41196-1_15

Premium Partners

    Image Credits