Advanced search
Publication Cover
Journal of the Operational Research Society Volume 46, 1995 - Issue 12
Submit an article Journal homepage
24
Views
224
CrossRef citations to date
0
Altmetric
Theoretical Paper

An Exchange Heuristic for Routeing Problems with Time Windows

Jean-Yves PotvinUniversité de MontréalCanada
&
Jean-Marc RousseauUniversité de MontréalCanada
Pages 1433-1446 | Received 01 Sep 1993, Accepted 01 Mar 1995, Published online: 20 Dec 2017

Citations (224)

Keep up to date with the latest research on this topic with citation updates for this article.

Subscribe to citation updates

Read on this site (13)

Sherif A. Fahmy. (2023) Hybrid and approximate algorithms for the dial-a-ride problem with adaptive ride times considering different service strategies. Engineering Optimization 55:8, pages 1263-1277.
Read now
Mir Ehsan Hesam Sadati, Vahid Akbari & Bülent Çatay. (2022) Electric vehicle routing problem with flexible deliveries. International Journal of Production Research 60:13, pages 4268-4294.
Read now
Mohamed Amine Masmoudi, Manar Hosny & Çağrı Koç. (2022) The fleet size and mix vehicle routing problem with synchronized visits. Transportation Letters 14:4, pages 427-445.
Read now
Xiangyong Li, Jieqi Li, Y.P. Aneja, Zhaoxia Guo & Peng Tian. (2019) Integrated order allocation and order routing problem for e-order fulfillment. IISE Transactions 51:10, pages 1128-1150.
Read now
Mustafa Mısır, Pieter Smet & Greet Vanden Berghe. (2015) An analysis of generalised heuristics for vehicle routing and personnel rostering problems. Journal of the Operational Research Society 66:5, pages 858-870.
Read now
L Schmidt & P Gazmuri. (2012) Online simulation for a real-time route dispatching problem. Journal of the Operational Research Society 63:11, pages 1492-1498.
Read now
Yufen Shao, JonathanF. Bard & AhmadI. Jarrah. (2012) The therapist routing and scheduling problem. IIE Transactions 44:10, pages 868-893.
Read now
U Derigs, B Li & U Vogel. (2010) Local search-based metaheuristics for the split delivery vehicle routing problem. Journal of the Operational Research Society 61:9, pages 1356-1364.
Read now
U Derigs & K Reuter. (2009) A simple and efficient tabu search heuristic for solving the open vehicle routing problem. Journal of the Operational Research Society 60:12, pages 1658-1669.
Read now
X-Y Li, P Tian & S C H Leung. (2009) An ant colony optimization metaheuristic hybridized with tabu search for open vehicle routing problems. Journal of the Operational Research Society 60:7, pages 1012-1025.
Read now
Michel Gendreau & Jean-Yves Potvin. (2008) Metaheuristics: A Canadian Perspective. INFOR: Information Systems and Operational Research 46:1, pages 71-80.
Read now
Silvio Nocera. (2007) Deriving Convergence of Vehicle Routing Problems using a Fictitious Play Approach. Journal of Information and Optimization Sciences 28:6, pages 997-1011.
Read now
Huan Neng Chiu, Yi Shyang Lee & Jen Huei Chang. (2006) Two approaches to solving the multi-depot vehicle routing problem with time windows in a time-based logistics environment. Production Planning & Control 17:5, pages 480-493.
Read now

Articles from other publishers (211)

Jean-François Côté, Renata Mansini & Alice Raffaele. (2024) Multi-period time window assignment for attended home delivery. European Journal of Operational Research 316:1, pages 295-309.
Crossref
Nadia Pourmohammad-Zia & Mark van Koningsveld. (2024) Sustainable urban logistics: A case study of waterway integration in Amsterdam. Sustainable Cities and Society 105, pages 105334.
Crossref
Tan Yu, Yongpei Guan & Xiang Zhong. (2024) Visiting nurses assignment and routing for decentralized telehealth service networks. Annals of Operations Research.
Crossref
Jie Zhang, Yanfeng Li & Zhaoyang Lu. (2024) Multi-period vehicle routing problem with time windows for drug distribution in the epidemic situation. Transportation Research Part C: Emerging Technologies 160, pages 104484.
Crossref
Jean Bertrand Gauthier & Stefan Irnich. (2024) Inter-depot moves and dynamic-radius search for multi-depot vehicle routing problems. Discrete Applied Mathematics 346, pages 131-153.
Crossref
Amir Mortazavi, Milad Ghasri & Tapabrata Ray. (2024) A linearly decreasing deterministic annealing algorithm for the multi-vehicle dial-a-ride problem. PLOS ONE 19:2, pages e0292683.
Crossref
Aakash Khochare, Francesco Betti Sorbelli, Yogesh Simmhan & Sajal K. Das. (2024) Improved Algorithms for Co-Scheduling of Edge Analytics and Routes for UAV Fleet Missions. IEEE/ACM Transactions on Networking 32:1, pages 17-33.
Crossref
Xin Wang, Yijing Liang, Xiangbo Tang & Xiyan Jiang. (2023) A multi-compartment electric vehicle routing problem with time windows and temperature and humidity settings for perishable product delivery. Expert Systems with Applications 233, pages 120974.
Crossref
Farbod Zahedi, Hamidreza Kia & Mohammad Khalilzadeh. (2023) A hybrid metaheuristic approach for solving a bi-objective capacitated electric vehicle routing problem with time windows and partial recharging. Journal of Advances in Management Research 20:4, pages 695-729.
Crossref
Chi Feng & Zhenyu Mei. (2023) Optimization of Shared Autonomous Vehicles Routing Problem: From the View of Parking. Sustainability 15:16, pages 12303.
Crossref
Baobin Huang, Lixin Tang, Roberto Baldacci, Gongshu Wang & Defeng Sun. (2023) A metaheuristic algorithm for a locomotive routing problem arising in the steel industry. European Journal of Operational Research 308:1, pages 385-399.
Crossref
Zhen Shu, Aijuan Song, Guohua Wu & Witold Pedrycz. (2023) Variable Reduction Strategy Integrated Variable Neighborhood Search and NSGA-II Hybrid Algorithm for Emergency Material Scheduling. Complex System Modeling and Simulation 3:2, pages 83-101.
Crossref
Pengfei He & Jin-Kao Hao. (2023) Memetic search for the minmax multiple traveling salesman problem with single and multiple depots. European Journal of Operational Research 307:3, pages 1055-1070.
Crossref
Lukas Janinhoff, Robert Klein & Daniel Scholz. (2023) Multitrip vehicle routing with delivery options: a data-driven application to the parcel industry. OR Spectrum.
Crossref
Pengfei He & Jin-Kao Hao. (2023) General Edge Assembly Crossover-Driven Memetic Search for Split Delivery Vehicle Routing. Transportation Science 57:2, pages 482-511.
Crossref
Dongbo Peng, Zhouqiao Zhao, Guoyuan Wu & Kanok Boriboonsomsin. (2023) Bi-Level Fleet Dispatching Strategy for Battery-Electric Trucks: A Real-World Case Study. Sustainability 15:2, pages 925.
Crossref
Amir Mortazavi, Milad Ghasri & Tapabrata Ray. (2023) A Linearly Decreasing Deterministic Annealing Algorithm for the Multivehicle Dial-a-Ride Problem. SSRN Electronic Journal.
Crossref
Vinícius R. Máximo, Jean-François Cordeau & Mariá C.V. Nascimento. (2022) An adaptive iterated local search heuristic for the Heterogeneous Fleet Vehicle Routing Problem. Computers & Operations Research 148, pages 105954.
Crossref
Marwan Abdelatti, Manbir Sodhi & Resit Sendag. (2022) A Multi-GPU Parallel Genetic Algorithm For Large-Scale Vehicle Routing Problems. A Multi-GPU Parallel Genetic Algorithm For Large-Scale Vehicle Routing Problems.
Hendrik SchaapMaximilian Schiffer, Michael Schneider & Grit Walther. (2022) A Large Neighborhood Search for the Vehicle Routing Problem with Multiple Time Windows. Transportation Science 56:5, pages 1369-1392.
Crossref
Christian Friedrich & Ralf Elbert. (2022) Urban consolidation centers and city toll schemes–Investigating the impact of city tolls on transshipment decisions. Transportation Research Part E: Logistics and Transportation Review 164, pages 102782.
Crossref
M. Amine Masmoudi, Simona Mancini, Roberto Baldacci & Yong-Hong Kuo. (2022) Vehicle routing problems with drones equipped with multi-package payload compartments. Transportation Research Part E: Logistics and Transportation Review 164, pages 102757.
Crossref
Michalis Mavrovouniotis, Changhe Li, Georgios Ellinas & Marios Polycarpou. (2022) Solving the Electric Capacitated Vehicle Routing Problem with Cargo Weight. Solving the Electric Capacitated Vehicle Routing Problem with Cargo Weight.
Han Huang, Shuling Yang, Xueqiang Li & Zhifeng Hao. (2022) An Embedded Hamiltonian Graph-Guided Heuristic Algorithm for Two-Echelon Vehicle Routing Problem. IEEE Transactions on Cybernetics 52:7, pages 5695-5707.
Crossref
Haipeng Cui, Shukai Chen, Rui Chen & Qiang Meng. (2022) A two-stage hybrid heuristic solution for the container drayage problem with trailer reposition. European Journal of Operational Research 299:2, pages 468-482.
Crossref
Alena Rybickova & Magdalena Betkova. (2022) Elderly on-demand transport in the Czech Republic: A case study. Elderly on-demand transport in the Czech Republic: A case study.
Débora P. Ronconi & João L. V. Manguino. (2022) GRASP and VNS approaches for a vehicle routing problem with step cost functions. Annals of Operations Research.
Crossref
Tomislav Erdelić & Tonči Carić. (2022) Goods Delivery with Electric Vehicles: Electric Vehicle Routing Optimization with Time Windows and Partial or Full Recharge. Energies 15:1, pages 285.
Crossref
Christian Friedrich & Ralf Elbert. (2022) Adaptive large neighborhood search for vehicle routing problems with transshipment facilities arising in city logistics. Computers & Operations Research 137, pages 105491.
Crossref
Weiyao Meng & Rong Qu. (2021) Automated design of search algorithms: Learning on algorithmic components. Expert Systems with Applications 185, pages 115493.
Crossref
Dan Wang & Hong Zhou. (2021) A Two-Echelon Electric Vehicle Routing Problem with Time Windows and Battery Swapping Stations. Applied Sciences 11:22, pages 10779.
Crossref
Vinícius Martins Santos Gandra, Hatice Çalık, Tony Wauters, Túlio A.M. Toffolo, Marco Antonio M. Carvalho & Greet Vanden Berghe. (2021) The impact of loading restrictions on the two-echelon location routing problem. Computers & Industrial Engineering 160, pages 107609.
Crossref
Alireza Eydi & Seyed Ali Ghasemi-Nezhad. (2021) A bi-objective vehicle routing problem with time windows and multiple demands. Ain Shams Engineering Journal 12:3, pages 2617-2630.
Crossref
Arjun Paul, Ravi Shankar Kumar, Chayanika Rout & Adrijit Goswami. (2021) Designing a multi-depot multi-period vehicle routing problem with time window: hybridization of tabu search and variable neighbourhood search algorithm. Sādhanā 46:3.
Crossref
Xinyu Wang, Shuai Shao & Jiafu Tang. (2021) Iterative Local-Search Heuristic for Weighted Vehicle Routing Problem. IEEE Transactions on Intelligent Transportation Systems 22:6, pages 3444-3454.
Crossref
Maximilian Schiffer, Patrick S. Klein, Gilbert Laporte & Grit Walther. (2021) Integrated planning for electric commercial vehicle fleets: A case study for retail mid-haul logistics networks. European Journal of Operational Research 291:3, pages 944-960.
Crossref
Wentao Li, Qihuan Zhang, Min Huang & Yang Yu. (2021) Multi-depot vehicle routing problem considering customer satisfaction. Multi-depot vehicle routing problem considering customer satisfaction.
Aakash Khochare, Yogesh Simmhan, Francesco Betti Sorbelli & Sajal K. Das. (2021) Heuristic Algorithms for Co-scheduling of Edge Analytics and Routes for UAV Fleet Missions. Heuristic Algorithms for Co-scheduling of Edge Analytics and Routes for UAV Fleet Missions.
Penglin Li, Chen Zhi & Wei Li. (2021) An Algorithm to Solve Heterogeneous Vehicle Routing Problem With Second Trip. IEEE Access 9, pages 12241-12255.
Crossref
Gonzalo Recio, MªPaz Linares, Víctor Diví & Josep Casanovas. (2021) Assessment of a Shared-Taxi Routing Service for Disabled People: Barcelona Case Study. Transportation Research Procedia 52, pages 549-556.
Crossref
Manolis N. Kritikos & Pantelis Z. Lappas. 2021. Advances in Core Computer Science-Based Technologies. Advances in Core Computer Science-Based Technologies 325 367 .
Isaac Lozano-Osorio, Jesus Sanchez-Oro, Miguel Ángel Rodriguez-Garcia & Abraham Duarte. (2020) Optimizing Computer Networks Communication with the Band Collocation Problem: A Variable Neighborhood Search Approach. Electronics 9:11, pages 1860.
Crossref
Wanyuan Wang, Hansi Tao & Yichuan Jiang. (2020) Efficient Delivery Services Sharing with Time Windows. Applied Sciences 10:21, pages 7431.
Crossref
Binhui Chen, Rong Qu, Ruibin Bai & Wasakorn Laesanklang. (2020) A variable neighborhood search algorithm with reinforcement learning for a real-life periodic vehicle routing problem with time windows and open routes. RAIRO - Operations Research 54:5, pages 1467-1494.
Crossref
Marwan F. Abdelatti & Manbir S. Sodhi. (2020) An improved GPU-accelerated heuristic technique applied to the capacitated vehicle routing problem. An improved GPU-accelerated heuristic technique applied to the capacitated vehicle routing problem.
Laura Delgado-Antequera, Rafael Caballero, Jesús Sánchez-Oro, J Manuel Colmenar & Rafael Martí. (2020) Iterated greedy with variable neighborhood search for a multiobjective waste collection problem. Expert Systems with Applications 145, pages 113101.
Crossref
Behzad Moradi. (2019) The new optimization algorithm for the vehicle routing problem with time windows using multi-objective discrete learnable evolution model. Soft Computing 24:9, pages 6741-6769.
Crossref
Jan Christiaens & Greet Vanden Berghe. (2020) Slack Induction by String Removals for Vehicle Routing Problems. Transportation Science 54:2, pages 417-433.
Crossref
Xueming Yan, Han Huang, Zhifeng Hao & Jiahai Wang. (2020) A Graph-Based Fuzzy Evolutionary Algorithm for Solving Two-Echelon Vehicle Routing Problems. IEEE Transactions on Evolutionary Computation 24:1, pages 129-141.
Crossref
Mohamed Amine Masmoudi, Manar Hosny, Emrah Demir & Erwin Pesch. (2019) Hybrid adaptive large neighborhood search algorithm for the mixed fleet heterogeneous dial-a-ride problem. Journal of Heuristics 26:1, pages 83-118.
Crossref
Yang Shen, Mingde Liu, Jian Yang, Yuhui Shi & Martin Middendorf. (2020) A Hybrid Swarm Intelligence Algorithm for Vehicle Routing Problem With Time Windows. IEEE Access 8, pages 93882-93893.
Crossref
Miroslaw Blocho. 2020. Smart Delivery Systems. Smart Delivery Systems 101 156 .
João L. V. Manguino & Débora P. Ronconi. 2020. Computational Logistics. Computational Logistics 231 245 .
Mohamed Amine Masmoudi, Manar Hosny & Emrah Demir. 2019. Solving Transport Problems. Solving Transport Problems 1 26 .
Dominik Goeke. (2019) Granular tabu search for the pickup and delivery problem with time windows and electric vehicles. European Journal of Operational Research 278:3, pages 821-836.
Crossref
Chang-Sheng Lin, Ming-Chao Chiang & Chu-Sing Yang. (2019) A Co-evolution Coral Reefs optimization Approach for Multi-objective Vehicle Routing Problem with Time Windows. A Co-evolution Coral Reefs optimization Approach for Multi-objective Vehicle Routing Problem with Time Windows.
Julian Hof & Michael Schneider. (2019) An adaptive large neighborhood search with path relinking for a class of vehicle‐routing problems with simultaneous pickup and delivery. Networks 74:3, pages 207-250.
Crossref
Ching-Wu Chu & Hsiu-Li Hsu. (2019) A heuristic algorithm for multiple trip vehicle routing problems with time window constraint and outside carrier selection. Maritime Business Review 4:3, pages 256-273.
Crossref
J. Andelmin & E. Bartolini. (2019) A multi-start local search heuristic for the Green Vehicle Routing Problem based on a multigraph reformulation. Computers & Operations Research 109, pages 43-63.
Crossref
Samuel Pelletier, Ola Jabali & Gilbert Laporte. (2019) The electric vehicle routing problem with energy consumption uncertainty. Transportation Research Part B: Methodological 126, pages 225-255.
Crossref
Alexander Fröhlich von Elmbach, Armin Scholl & Rico Walter. (2019) Minimizing the maximal ergonomic burden in intra-hospital patient transportation. European Journal of Operational Research 276:3, pages 840-854.
Crossref
Jian Li, Tingting Li, Yugang Yu, Zhaotong Zhang, Panos M. Pardalos, Yi Zhang & Yunfeng Ma. (2019) Discrete firefly algorithm with compound neighborhoods for asymmetric multi-depot vehicle routing problem in the maintenance of farm machinery. Applied Soft Computing 81, pages 105460.
Crossref
Tomislav Erdelić & Tonči Carić. (2019) A Survey on the Electric Vehicle Routing Problem: Variants and Solution Approaches. Journal of Advanced Transportation 2019, pages 1-48.
Crossref
Dimitris Bertsimas, Patrick Jaillet & Sébastien Martin. (2019) Online Vehicle Routing: The Edge of Optimization in Large-Scale Applications. Operations Research 67:1, pages 143-162.
Crossref
Binhui Chen, Rong Qu, Ruibin Bai & Wasakorn Laesanklang. (2018) A hyper-heuristic with two guidance indicators for bi-objective mixed-shift vehicle routing problem with time windows. Applied Intelligence 48:12, pages 4937-4959.
Crossref
Ольга Эдуардовна Долгова & Владимир Викторович Пересветов. (2018) An ant colony optimization algorithm with time window constraints relaxation for solving the vehicle routing problem. Вычислительные технологии:5(23), pages 49-62.
Crossref
Shuai Zhang, Yuvraj Gajpal, S.S. Appadoo & M.M.S. Abdulkader. (2018) Electric vehicle routing problem with recharging stations for minimizing energy consumption. International Journal of Production Economics 203, pages 404-413.
Crossref
Douglas M. Miranda, Juergen Branke & Samuel V. Conceição. (2018) Algorithms for the multi-objective vehicle routing problem with hard time windows and stochastic travel time and service time. Applied Soft Computing 70, pages 66-79.
Crossref
Mohamed Amine Masmoudi, Manar Hosny, Emrah Demir & Naoufel Cheikhrouhou. (2018) A study on the heterogeneous fleet of alternative fuel vehicles: Reducing CO2 emissions by means of biodiesel fuel. Transportation Research Part D: Transport and Environment 63, pages 137-155.
Crossref
Sandra Zajac. (2017) On a two-phase solution approach for the bi-objective k-dissimilar vehicle routing problem. Journal of Heuristics 24:3, pages 515-550.
Crossref
Sungwon Lee & Taesung Hwang. (2018) Estimating Emissions from Regional Freight Delivery under Different Urban Development Scenarios. Sustainability 10:4, pages 1188.
Crossref
Chao Wang, Shengchuan Zhou, Yang Gao & Chao Liu. (2018) A self-adaptive bat algorithm for the truck and trailer routing problem. Engineering Computations 35:1, pages 108-135.
Crossref
Maximilian Schiffer & Grit Walther. (2018) An Adaptive Large Neighborhood Search for the Location-routing Problem with Intra-route Facilities. Transportation Science 52:2, pages 331-352.
Crossref
Maximilian Schiffer, Michael Schneider & Gilbert Laporte. (2018) Designing sustainable mid-haul logistics networks with intra-route multi-resource facilities. European Journal of Operational Research 265:2, pages 517-532.
Crossref
Xinye Chen, Ping Zhang, Guanglong Du & Fang Li. (2018) Ant Colony Optimization Based Memetic Algorithm to Solve Bi-Objective Multiple Traveling Salesmen Problem for Multi-Robot Systems. IEEE Access 6, pages 21745-21757.
Crossref
. 2018. Operations Management in Agriculture. Operations Management in Agriculture 213 222 .
David Mester, Olli Bräysy & Wout Dullaert. 2018. Computational Methods and Models for Transport. Computational Methods and Models for Transport 87 96 .
Abdelrahman E.E. Eltoukhy, Felix T.S. Chan, S.H. Chung, Ben Niu & X.P. Wang. (2017) Heuristic approaches for operational aircraft maintenance routing problem with maximum flying hours and man-power availability considerations. Industrial Management & Data Systems 117:10, pages 2142-2170.
Crossref
Michael Schneider, Fabian Schwahn & Daniele Vigo. (2017) Designing granular solution methods for routing problems with time windows. European Journal of Operational Research 263:2, pages 493-509.
Crossref
Aişe Zülal Şevkli & Bekir Güler. (2017) A multi-phase oscillated variable neighbourhood search algorithm for a real-world open vehicle routing problem. Applied Soft Computing 58, pages 128-144.
Crossref
Vikas Agrawal, Constance Lightner, Carin Lightner-Laws & Neal Wagner. (2016) A bi-criteria evolutionary algorithm for a constrained multi-depot vehicle routing problem. Soft Computing 21:17, pages 5159-5178.
Crossref
Javier Arias-Osorio & Andrés Fernando Niño-Saénz. (2017) Un Algoritmo GRASP híbrido para el 2eCVRP. DYNA 84:202, pages 16-25.
Crossref
Mohamed Amine Masmoudi, Kris Braekers, Malek Masmoudi & Abdelaziz Dammak. (2017) A hybrid Genetic Algorithm for the Heterogeneous Dial-A-Ride Problem. Computers & Operations Research 81, pages 1-13.
Crossref
Yves Molenbruch, Kris Braekers & An Caris. (2015) Operational effects of service level variations for the dial-a-ride problem. Central European Journal of Operations Research 25:1, pages 71-90.
Crossref
Suresh Nanda Kumar & Ramasamy Panneerselvam. (2017) Development of an Efficient Genetic Algorithm for the Time Dependent Vehicle Routing Problem with Time Windows. American Journal of Operations Research 07:01, pages 1-25.
Crossref
Jeeu Fong Sze, Said Salhi & Niaz Wassan. (2016) A hybridisation of adaptive variable neighbourhood search and large neighbourhood search: Application to the vehicle routing problem. Expert Systems with Applications 65, pages 383-397.
Crossref
Jakub Nalepa & Miroslaw Blocho. (2015) Adaptive memetic algorithm for minimizing distance in the vehicle routing problem with time windows. Soft Computing 20:6, pages 2309-2327.
Crossref
Cheikh Noufissa & El Merouani Mohamed. (2016) A hybrid ant colony for solving Inventory Routing Problem. A hybrid ant colony for solving Inventory Routing Problem.
Anthony Fu-Wha Han & Yu-Ching Chu. (2016) A multi-start heuristic approach for the split-delivery vehicle routing problem with minimum delivery amounts. Transportation Research Part E: Logistics and Transportation Review 88, pages 11-31.
Crossref
Michael Schneider. (2016) The vehicle-routing problem with time windows and driver-specific times. European Journal of Operational Research 250:1, pages 101-119.
Crossref
Juan Antonio Sicilia, Carlos Quemada, Beatriz Royo & David Escuín. (2016) An optimization algorithm for solving the rich vehicle routing problem based on Variable Neighborhood Search and Tabu Search metaheuristics. Journal of Computational and Applied Mathematics 291, pages 468-477.
Crossref
Briseida Sarasola, Karl F. Doerner, Verena Schmid & Enrique Alba. (2015) Variable neighborhood search for the stochastic and dynamic vehicle routing problem. Annals of Operations Research 236:2, pages 425-461.
Crossref
Zheng Wang, Ying Li & Xiangpei Hu. (2015) A heuristic approach and a tabu search for the heterogeneous multi-type fleet vehicle routing problem with time windows and an incompatible loading constraint. Computers & Industrial Engineering 89, pages 162-176.
Crossref
Jesica de Armas, Eduardo Lalla-Ruiz, Christopher Expósito-Izquierdo, Dario Landa-Silva & Belén Melián-Batista. (2015) A hybrid GRASP-VNS for ship routing and scheduling problem with discretized time windows. Engineering Applications of Artificial Intelligence 45, pages 350-360.
Crossref
Jakub Nalepa & Miroslaw Blocho. (2014) Co-operation in the Parallel Memetic Algorithm. International Journal of Parallel Programming 43:5, pages 812-839.
Crossref
Hassan Rashidi & Edward Tsang. 2015. Vehicle Scheduling in Port Automation. Vehicle Scheduling in Port Automation 160 173 .
Dominik Goeke & Michael Schneider. (2015) Routing a mixed fleet of electric and conventional vehicles. European Journal of Operational Research 245:1, pages 81-99.
Crossref
Somayeh Allahyari, Majid Salari & Daniele Vigo. (2015) A hybrid metaheuristic algorithm for the multi-depot covering tour vehicle routing problem. European Journal of Operational Research 242:3, pages 756-768.
Crossref
Chao Wang, Dong Mu, Fu Zhao & John W. Sutherland. (2015) A parallel simulated annealing method for the vehicle routing problem with simultaneous pickup–delivery and time windows. Computers & Industrial Engineering 83, pages 111-122.
Crossref
Ola Jabali, Roel Leus, Tom Van Woensel & Ton de Kok. (2013) Self-imposed time windows in vehicle routing problems. OR Spectrum 37:2, pages 331-352.
Crossref
Thibaut Vidal, Teodor Gabriel Crainic, Michel Gendreau & Christian Prins. (2015) Timing problems and algorithms: Time decisions for sequences of activities. Networks 65:2, pages 102-128.
Crossref
Lily Wong & Noor Hasnah Moin. Enhanced ant colony optimization for inventory routing problem. Enhanced ant colony optimization for inventory routing problem.
Patrizia Beraldi, Maria Elena Bruni, Demetrio Laganà & Roberto Musmanno. (2015) The mixed capacitated general routing problem under uncertainty. European Journal of Operational Research 240:2, pages 382-392.
Crossref
Bekir Güler & Aişe Zülal Şevkli. 2015. Neural Information Processing. Neural Information Processing 182 189 .
L. Wong & N. H. Moin. (2014) Ant colony optimization for one-to-many network inventory routing problem. Ant colony optimization for one-to-many network inventory routing problem.
Dariusz Barbucha. (2014) A cooperative population learning algorithm for vehicle routing problem with time windows. Neurocomputing 146, pages 210-229.
Crossref
Adamo Bosco, Demetrio Laganà, Roberto Musmanno & Francesca Vocaturo. (2014) A matheuristic algorithm for the mixed capacitated general routing problem. Networks 64:4, pages 262-281.
Crossref
Michael Schneider, Andreas Stenger & Dominik Goeke. (2014) The Electric Vehicle-Routing Problem with Time Windows and Recharging Stations. Transportation Science 48:4, pages 500-520.
Crossref
Kris Braekers, An Caris & Gerrit K. Janssens. (2014) Exact and meta-heuristic approach for a general heterogeneous dial-a-ride problem with multiple depots. Transportation Research Part B: Methodological 67, pages 166-186.
Crossref
Phuong Khanh Nguyen, Teodor Gabriel Crainic & Michel Toulouse. (2014) A hybrid generational genetic algorithm for the periodic vehicle routing problem with time windows. Journal of Heuristics 20:4, pages 383-416.
Crossref
Ulrich Derigs & Markus Pullmann. (2014) Solving multitrip vehicle routing under order incompatibilities: A VRP arising in supply chain management. Networks 64:1, pages 29-39.
Crossref
Wan-Yu Liu, Chun-Cheng Lin, Ching-Ren Chiu, You-Song Tsao & Qunwei Wang. (2014) Minimizing the Carbon Footprint for the Time-Dependent Heterogeneous-Fleet Vehicle Routing Problem with Alternative Paths. Sustainability 6:7, pages 4658-4684.
Crossref
Teodor Gabriel Crainic & Frédéric Semet. 2014. Applications of Combinatorial Optimization. Applications of Combinatorial Optimization 111 175 .
. 2014. Applications of Combinatorial Optimization. Applications of Combinatorial Optimization 365 399 .
Kris Braekers, An Caris & Gerrit K. Janssens. (2014) Bi-objective optimization of drayage operations in the service area of intermodal terminals. Transportation Research Part E: Logistics and Transportation Review 65, pages 50-69.
Crossref
Jianyong Jin, Teodor Gabriel Crainic & Arne Løkketangen. (2014) A cooperative parallel metaheuristic for the capacitated vehicle routing problem. Computers & Operations Research 44, pages 33-41.
Crossref
Jonathan F. Bard, Yufen Shao & Ahmad I. Jarrah. (2013) A sequential GRASP for the therapist routing and scheduling problem. Journal of Scheduling 17:2, pages 109-133.
Crossref
Narath Bhusiri, Ali Gul Qureshi & Eiichi Taniguchi. (2014) Application of the Just-In-Time Concept in Urban Freight Transport. Procedia - Social and Behavioral Sciences 125, pages 171-185.
Crossref
Claudio Contardo, Jean-François Cordeau & Bernard Gendron. (2013) A GRASP + ILP-based metaheuristic for the capacitated location-routing problem. Journal of Heuristics 20:1, pages 1-38.
Crossref
Leila HajibabaiSeyed M. NourbakhshYanfeng OuyangFan Peng. (2014) Network Routing of Snowplow Trucks with Resource Replenishment and Plowing Priorities. Transportation Research Record: Journal of the Transportation Research Board 2440:1, pages 16-25.
Crossref
Zheng-yang Zeng, Wei-sheng Xu, Zhi-yu Xu & Wei-hui Shao. (2014) A Hybrid GRASP+VND Heuristic for the Two-Echelon Vehicle Routing Problem Arising in City Logistics. Mathematical Problems in Engineering 2014, pages 1-11.
Crossref
Amine Dhahri, Kamel Zidi & Khaled Ghedira. (2014) Variable Neighborhood Search based Set Covering ILP Model for the Vehicle Routing Problem with Time Windows. Procedia Computer Science 29, pages 844-854.
Crossref
S. P. Anbuudayasankar, K. Ganesh & Sanjay MohapatraS. P. Anbuudayasankar, K. Ganesh & Sanjay Mohapatra. 2014. Models for Practical Routing Problems in Logistics. Models for Practical Routing Problems in Logistics 95 122 .
Thibaut Vidal, Teodor Gabriel Crainic, Michel Gendreau & Christian Prins. (2013) Heuristics for multi-attribute vehicle routing problems: A survey and synthesis. European Journal of Operational Research 231:1, pages 1-21.
Crossref
Xue Jun Chen, Fang Geng Zhao & Xiao Yan Shi. (2013) Research on the Vehicle Scheduling Problem in Wartime Spare Parts Distribution. Applied Mechanics and Materials 421, pages 883-888.
Crossref
Vera Hemmelmayr, Karl F. Doerner, Richard F. Hartl & Stefan Rath. (2011) A heuristic solution method for node routing based solid waste collection problems. Journal of Heuristics 19:2, pages 129-156.
Crossref
Ulrich Derigs, Markus Pullmann & Ulrich Vogel. (2013) A short note on applying a simple LS/LNS-based metaheuristic to the rollon–rolloff vehicle routing problem. Computers & Operations Research 40:3, pages 867-872.
Crossref
Selma Khebbache-Hadji, Christian Prins, Alice Yalaoui & Mohamed Reghioui. (2011) Heuristics and memetic algorithm for the two-dimensional loading capacitated vehicle routing problem with time windows. Central European Journal of Operations Research 21:2, pages 307-336.
Crossref
Kris Braekers, An Caris & Gerrit K. Janssens. (2012) Integrated planning of loaded and empty container movements. OR Spectrum 35:2, pages 457-478.
Crossref
Teodor Gabriel Crainic & Frédéric Semet. 2013. Applications of Combinatorial Optimization. Applications of Combinatorial Optimization 111 175 .
Jin Li. (2013) Model and Simulation for Collaborative VRPSPD. Journal of Networks 8:2.
Crossref
Ulrich Derigs, Markus Pullmann & Ulrich Vogel. (2013) Truck and trailer routing—Problems, heuristics and computational experience. Computers & Operations Research 40:2, pages 536-546.
Crossref
Jakub Nalepa & Zbigniew J. Czech. 2013. Adaptive and Natural Computing Algorithms. Adaptive and Natural Computing Algorithms 396 405 .
Francesco FerrucciFrancesco Ferrucci. 2013. Pro-active Dynamic Vehicle Routing. Pro-active Dynamic Vehicle Routing 15 79 .
Dražen Popović, Milorad Vidović & Gordana Radivojević. (2012) Variable Neighborhood Search heuristic for the Inventory Routing Problem in fuel delivery. Expert Systems with Applications 39:18, pages 13390-13398.
Crossref
Vera C. Hemmelmayr, Jean-François Cordeau & Teodor Gabriel Crainic. (2012) An adaptive large neighborhood search heuristic for Two-Echelon Vehicle Routing Problems arising in city logistics. Computers & Operations Research 39:12, pages 3215-3228.
Crossref
Jianyong Jin, Teodor Gabriel Crainic & Arne Løkketangen. (2012) A parallel multi-neighborhood cooperative tabu search for capacitated vehicle routing problems. European Journal of Operational Research 222:3, pages 441-451.
Crossref
David Escuín, Carlos Millán & Emilio Larrodé. (2009) Modelization of Time-Dependent Urban Freight Problems by Using a Multiple Number of Distribution Centers. Networks and Spatial Economics 12:3, pages 321-336.
Crossref
Jean‐François Côté, Michel Gendreau & Jean‐Yves Potvin. (2012) Large neighborhood search for the pickup and delivery traveling salesman problem with multiple stacks. Networks 60:1, pages 19-30.
Crossref
Mostepha R. Khouadjia, Briseida Sarasola, Enrique Alba, Laetitia Jourdan & El-Ghazali Talbi. (2012) A comparative study between dynamic adapted PSO and VNS for the vehicle routing problem with dynamic requests. Applied Soft Computing 12:4, pages 1426-1439.
Crossref
Gülfem Tuzkaya, Bahadir Gülsün, Ender Bildik & E. Gözde Çaglar. 2012. Hybrid Algorithms for Service, Computing and Manufacturing Systems. Hybrid Algorithms for Service, Computing and Manufacturing Systems 79 97 .
Claudia Gómez Santillán, Laura Cruz Reyes, María Lucila Morales Rodríguez, Juan Javier González Barbosa, Oscar Castillo López, Gilberto Rivera Zarate & Paula Hernández. 2012. Logistics Management and Optimization through Hybrid Artificial Intelligence Systems. Logistics Management and Optimization through Hybrid Artificial Intelligence Systems 207 237 .
Xiangyong Li, Stephen C.H. Leung & Peng Tian. (2012) A multistart adaptive memory-based tabu search algorithm for the heterogeneous fixed fleet open vehicle routing problem. Expert Systems with Applications 39:1, pages 365-374.
Crossref
Chenbo Zhu, J. Q. Hu, Fengchun Wang, Yifan Xu & Rongzeng Cao. (2010) On the tour planning problem. Annals of Operations Research 192:1, pages 67-86.
Crossref
Christian Schauer & Günther R. Raidl. 2012. Parallel Problem Solving from Nature - PPSN XII. Parallel Problem Solving from Nature - PPSN XII 458 467 .
Mirosław Błocho & Zbigniew J. Czech. 2012. Parallel Processing and Applied Mathematics. Parallel Processing and Applied Mathematics 255 265 .
Martin Schwengerer, Sandro Pirkwieser & Günther R. Raidl. 2012. Evolutionary Computation in Combinatorial Optimization. Evolutionary Computation in Combinatorial Optimization 13 24 .
Gang Dong, Jiafu Tang, Kin Keung Lai & Yuan Kong. (2009) An exact algorithm for vehicle routing and scheduling problem of free pickup and delivery service in flight ticket sales companies based on set-partitioning model. Journal of Intelligent Manufacturing 22:5, pages 789-799.
Crossref
Ulrich Derigs, Jens Gottlieb, Jochen Kalkoff, Michael Piesche, Franz Rothlauf & Ulrich Vogel. (2010) Vehicle routing with compartments: applications, modelling and heuristics. OR Spectrum 33:4, pages 885-914.
Crossref
King-Wah Pang. (2011) An adaptive parallel route construction heuristic for the vehicle routing problem with time windows constraints. Expert Systems with Applications 38:9, pages 11939-11946.
Crossref
Justin Jackson, Yu-hsien Chang & Anouck Girard. (2010) A new measure of solution quality for combinatorial task assignment problems. A new measure of solution quality for combinatorial task assignment problems.
Xiangyong Li, Peng Tian & Y.P. Aneja. (2010) An adaptive memory programming metaheuristic for the heterogeneous fixed fleet vehicle routing problem. Transportation Research Part E: Logistics and Transportation Review 46:6, pages 1111-1127.
Crossref
Pieter Vansteenwegen, Wouter Souffriau & Kenneth Sörensen. (2010) Solving the mobile mapping van problem: A hybrid metaheuristic for capacitated arc routing with soft time windows. Computers & Operations Research 37:11, pages 1870-1876.
Crossref
Mariam Tagmouti, Michel Gendreau & Jean-Yves Potvin. (2010) A variable neighborhood descent heuristic for arc routing problems with time-dependent service costs. Computers & Industrial Engineering 59:4, pages 954-963.
Crossref
Nasser A. El-Sherbeny. (2010) Vehicle routing with time windows: An overview of exact, heuristic and metaheuristic methods. Journal of King Saud University - Science 22:3, pages 123-131.
Crossref
Juliane Müller. (2010) Approximative solutions to the bicriterion Vehicle Routing Problem with Time Windows. European Journal of Operational Research 202:1, pages 223-231.
Crossref
Yuichi Nagata, Olli Bräysy & Wout Dullaert. (2010) A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows. Computers & Operations Research 37:4, pages 724-737.
Crossref
Sandro Pirkwieser & Günther R. Raidl. 2010. Hybrid Metaheuristics. Hybrid Metaheuristics 174 189 .
Juan Javier González-Barbosa, José Francisco Delgado-Orta, Laura Cruz-Reyes, Héctor Joaquín Fraire-Huacuja & Apolinar Ramirez-Saldivar. 2010. Soft Computing for Recognition Based on Biometrics. Soft Computing for Recognition Based on Biometrics 365 385 .
Jian-Ming Li, Hong-Song Tan, Xu Li & Lin-Lin Liu. 2010. Advances in Intelligent Decision Technologies. Advances in Intelligent Decision Technologies 201 208 .
Sandro Pirkwieser & Günther R. Raidl. 2010. Evolutionary Computation in Combinatorial Optimization. Evolutionary Computation in Combinatorial Optimization 226 238 .
P. Sivakumar, K. Ganesh, S. P. Nachiappan & S. Arunachalam. 2010. Enterprise Networks and Logistics for Agile Manufacturing. Enterprise Networks and Logistics for Agile Manufacturing 311 331 .
Yuichi Nagata & Olli Bräysy. (2009) Edge assembly‐based memetic algorithm for the capacitated vehicle routing problem. Networks 54:4, pages 205-215.
Crossref
Jean-Yves Potvin. (2009) State-of-the Art Review —Evolutionary Algorithms for Vehicle Routing . INFORMS Journal on Computing 21:4, pages 518-548.
Crossref
Xiaoyan Shi, Fanggeng Zhao & Yancheng Gong. (2009) Genetic algorithm for the one-commodity pickup-and-delivery vehicle routing problem. Genetic algorithm for the one-commodity pickup-and-delivery vehicle routing problem.
Dong Mei, Xiaoyan Shi & Fanggeng Zhao. (2009) An improved ACO algorithm for vehicle scheduling problem in military material distribution. An improved ACO algorithm for vehicle scheduling problem in military material distribution.
Olli Bräysy, Pentti Nakari, Wout Dullaert & Pekka Neittaanmäki. (2009) An optimization approach for communal home meal delivery service: A case study. Journal of Computational and Applied Mathematics 232:1, pages 46-53.
Crossref
Yuichi Nagata & Olli Bräysy. (2009) A powerful route minimization heuristic for the vehicle routing problem with time windows. Operations Research Letters 37:5, pages 333-338.
Crossref
S. Khebbache, C. Prins, A. Yalaoui & M. Reghioui. (2009) Memetic Algorithm for two-dimensional loading capacitated vehicle routing problem with time windows. Memetic Algorithm for two-dimensional loading capacitated vehicle routing problem with time windows.
S. Khebbache, C. Prins, A. Yalaoui & M. Reghioui. (2009) Heuristics for Two-Dimensional Loading Capacitated Vehicle Routing Problem with Time Windows. IFAC Proceedings Volumes 42:4, pages 1544-1549.
Crossref
Sandro Pirkwieser & Günther R. Raidl. 2009. Hybrid Metaheuristics. Hybrid Metaheuristics 45 59 .
Laura Cruz R.Juan J. Gonzalez B.José F. Delgado Orta, Barbara A. Arrañaga C.Hector J. Fraire H.. 2009. Hybrid Artificial Intelligence Systems. Hybrid Artificial Intelligence Systems 670 677 .
Rodolfo Dondo, Carlos A. Méndez & Jaime Cerdá. (2008) Optimal management of logistic activities in multi-site environments. Computers & Chemical Engineering 32:11, pages 2547-2569.
Crossref
Sophie N. Parragh, Karl F. Doerner & Richard F. Hartl. (2008) A survey on pickup and delivery problems. Journal für Betriebswirtschaft 58:1, pages 21-51.
Crossref
Laura Cruz Reyes, José F. Delgado Orta, Juan J. González Barbosa, José Torres Jimenez, Héctor J. Fraire Huacuja & Bárbara A. Arrañaga Cruz. 2008. Foundations of Intelligent Systems. Foundations of Intelligent Systems 329 338 .
Chananes Akjiratikarl, Pisal Yenradee & Paul R. Drake. (2007) PSO-based algorithm for home care worker scheduling in the UK. Computers & Industrial Engineering 53:4, pages 559-583.
Crossref
David Mester & Olli Bräysy. (2007) Active-guided evolution strategies for large-scale capacitated vehicle routing problems. Computers & Operations Research 34:10, pages 2964-2975.
Crossref
Jari Kytöjoki, Teemu Nuortio, Olli Bräysy & Michel Gendreau. (2007) An efficient variable neighborhood search heuristic for very large scale vehicle routing problems. Computers & Operations Research 34:9, pages 2743-2757.
Crossref
U. Derigs & R. Kaiser. (2007) Applying the attribute based hill climber heuristic to the vehicle routing problem. European Journal of Operational Research 177:2, pages 719-732.
Crossref
David Mester, Olli Bräysy & Wout Dullaert. (2007) A multi-parametric evolution strategies algorithm for vehicle routing problems. Expert Systems with Applications 32:2, pages 508-517.
Crossref
Jean-François Cordeau, Gilbert Laporte, Martin W.P. Savelsbergh & Daniele Vigo. 2007. Transportation. Transportation 367 428 .
Raphael Dorne, Patrick Mills & Chris Voudouris. 2007. Metaheuristics. Metaheuristics 389 408 .
T. Rusu & V. Bulacovschi. (2007) Computer aid molecular design based on meta‐heuristics techniques. International Journal of Quantum Chemistry 107:8, pages 1745-1751.
Crossref
Brahim Rekiek, Alain Delchambre & Hussain Aziz Saleh. (2006) Handicapped Person Transportation: An application of the Grouping Genetic Algorithm. Engineering Applications of Artificial Intelligence 19:5, pages 511-520.
Crossref
Hon Wai Leong & Ming Liu. (2006) A multi-agent algorithm for vehicle routing problem with time window. A multi-agent algorithm for vehicle routing problem with time window.
Víctor YepesJosep Medina. (2006) Economic Heuristic Optimization for Heterogeneous Fleet VRPHESTW. Journal of Transportation Engineering 132:4, pages 303-311.
Crossref
David Mester & Olli Bräysy. (2005) Active guided evolution strategies for large-scale vehicle routing problems with time windows. Computers & Operations Research 32:6, pages 1593-1614.
Crossref

Displaying 200 of 224 citing articles. Use the download link below to view the full list of citing articles.

Download full citations list

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.