An adaptive large neighborhood search algorithm for vehicle routing problem with multiple time windows constraints

DOI10.3934/jimo.2021197OpenAlexW3217346829MaRDI QIDQ2083393

Ziyu Hu, Bin Feng, Li-Xin Wei

Publication date: 10 October 2022

Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/jimo.2021197

zbMATH Keywords

local searchvehicle routing problemadaptive large neighborhood searchmultiple time windows

Mathematics Subject Classification ID

Mixed integer programming (90C11) Search theory (90B40) Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27)

Related Items (1)

Bi-objective blood product scheduling under blood shortage and limited supply

Uses Software

• VRP

Cites Work

• Adaptive large neighborhood search for the pickup and delivery problem with time windows, profits, and reserved requests
• A hybrid variable neighborhood tabu search heuristic for the vehicle routing problem with multiple time windows
• A general heuristic for vehicle routing problems
• An adaptive large neighborhood search heuristic for the vehicle routing problem with time windows and synchronized visits
• An exact column generation-based algorithm for bi-objective vehicle routing problems
• Multigraph modeling and adaptive large neighborhood search for the vehicle routing problem with time windows
• A branch-and-cut algorithm for the two-echelon capacitated vehicle routing problem with grouping constraints
• Variable neighborhood search for vehicle routing problem with multiple time windows
• A concise guide to existing and emerging vehicle routing problem variants
• Rich routing problems arising in supply chain management
• The vehicle routing problem with simultaneous pickup and delivery and handling costs
• A hybrid adaptive large neighborhood search heuristic for the team orienteering problem
• Vehicle Routing
• Ant colony system for a VRP with multiple time windows and multiple visits
• A selective adaptive large neighborhood search heuristic for the profitable tour problem with simultaneous pickup and delivery services

This page was built for publication: An adaptive large neighborhood search algorithm for vehicle routing problem with multiple time windows constraints