A covering traveling salesman problem with profit in the last mile delivery
From MaRDI portal
Publication:2070135
DOI10.1007/s11590-021-01709-0zbMath1484.90094OpenAlexW3136451821MaRDI QIDQ2070135
Junfeng Dong, Xiaoning Zang, Li Jiang, Chang-yong Liang
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-021-01709-0
Uses Software
Cites Work
- Corrigendum to ``An efficient evolutionary algorithm for the ring star problem
- Variable neighborhood search for location routing
- Time constrained maximal covering salesman problem with weighted demands and partial coverage
- An integer linear programming based heuristic for the capacitated \(m\)-ring-star problem
- On the empirical time complexity of finding optimal solutions vs proving optimality for Euclidean TSP instances
- Multiple depot ring star problem: a polyhedral study and an exact algorithm
- 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
- The ring-star problem: a new integer programming formulation and a branch-and-cut algorithm
- Solving the family traveling salesman problem
- Multi-objective variable neighborhood search: an application to combinatorial optimization problems
- Heuristics for the traveling salesman problem with pickup and delivery
- Variable neighborhood search
- Variable neighborhood tabu search and its application to the median cycle problem.
- A multi-depot two-echelon vehicle routing problem with delivery options arising in the last mile distribution
- Pricing strategies for capacitated ring-star problems based on dynamic programming algorithms
- How to choose ``last mile delivery modes for E-fulfillment
- A branch-and-cut-and-price approach for the capacitated \(m\)-ring-star problem
- An integer programming-based local search for the covering salesman problem
- Heuristics for the multi-vehicle covering tour problem
- Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
- A variable neighborhood search heuristic for periodic routing problems
- The Capacitated m-Ring-Star Problem
- An exact algorithm for solving the ring star problem
- TSPLIB—A Traveling Salesman Problem Library
- The Covering Tour Problem
- The Ring Star Problem: Polyhedral analysis and exact algorithm
- 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 covering traveling salesman problem with profit in the last mile delivery
