A variable neighborhood search for the last-mile delivery problem during major infectious disease outbreak
From MaRDI portal
Publication:2070131
DOI10.1007/s11590-020-01693-xzbMath1483.90137OpenAlexW3120498096MaRDI QIDQ2070131
Li Jiang, Xiaoning Zang, Junfeng Dong, Chang-yong Liang, Nenad Mladenović
Publication date: 21 January 2022
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-020-01693-x
Applications of mathematical programming (90C90) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Uses Software
Cites Work
- Corrigendum to ``An efficient evolutionary algorithm for the ring star problem
- An integer linear programming based heuristic for the capacitated \(m\)-ring-star problem
- The stop-and-drop problem in nonprofit food distribution networks
- A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for the capacitated vehicle routing problem
- A heuristic procedure for the capacitated \(m\)-ring-star problem
- Practical bilevel optimization. Algorithms and applications
- Variable neighborhood search
- Variable neighborhood tabu search and its application to the median cycle problem.
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
- Foundations of bilevel programming
- An integer programming-based local search for the covering salesman problem
- The vehicle routing-allocation problem: A unifying framework
- A branch-and-price algorithm for a vehicle routing with demand allocation problem
- A transformation technique for the clustered generalized traveling salesman problem with applications to logistics
- Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
- An overview of bilevel optimization
- The Generalized Covering Salesman Problem
- Integer Programming Formulation of Traveling Salesman Problems
- Optimal routing and process scheduling for a mobile service facility
- The Capacitated m-Ring-Star Problem
- A tabu search algorithm for the single vehicle routing allocation problem
- TSPLIB—A Traveling Salesman Problem Library
- The Covering Tour Problem
- Efficient heuristics for Median Cycle Problems
- The Covering Salesman Problem
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
This page was built for publication: A variable neighborhood search for the last-mile delivery problem during major infectious disease outbreak
