A covering traveling salesman problem with profit in the last mile delivery
From MaRDI portal
(Redirected from Publication:2070135)
Recommendations
- The two-echelon vehicle routing problem with covering options: city logistics with cargo bikes and parcel lockers
- A generalized bin packing problem for parcel delivery in last-mile logistics
- The time constrained maximal covering salesman problem
- A multi-depot two-echelon vehicle routing problem with delivery options arising in the last mile distribution
- The Covering Salesman Problem
Cites work
- A branch-and-cut-and-price approach for the capacitated \(m\)-ring-star problem
- A heuristic procedure for the capacitated m-ring-star problem
- A multi-depot two-echelon vehicle routing problem with delivery options arising in the last mile distribution
- A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for the capacitated vehicle routing problem
- A variable neighborhood search heuristic for periodic routing problems
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- An exact algorithm for solving the ring star problem
- An integer linear programming based heuristic for the capacitated \(m\)-ring-star problem
- An integer programming-based local search for the covering salesman problem
- Corrigendum to ``An efficient evolutionary algorithm for the ring star problem
- Efficient heuristics for Median Cycle Problems
- Heuristics for the multi-vehicle covering tour problem
- Heuristics for the traveling salesman problem with pickup and delivery
- How to choose ``last mile delivery modes for E-fulfillment
- Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
- Multi-objective variable neighborhood search: an application to combinatorial optimization problems
- Multiple depot ring star problem: a polyhedral study and an exact algorithm
- On the empirical time complexity of finding optimal solutions vs proving optimality for Euclidean TSP instances
- Pricing strategies for capacitated ring-star problems based on dynamic programming algorithms
- Solving the family traveling salesman problem
- The Capacitated m-Ring-Star Problem
- The Covering Salesman Problem
- The Covering Tour Problem
- The Ring Star Problem: Polyhedral analysis and exact algorithm
- The ring-star problem: a new integer programming formulation and a branch-and-cut algorithm
- Time constrained maximal covering salesman problem with weighted demands and partial coverage
- TSPLIB—A Traveling Salesman Problem Library
- Variable neighborhood search
- Variable neighborhood search for location routing
- Variable neighborhood tabu search and its application to the median cycle problem.
Cited in
(10)- A generalized bin packing problem for parcel delivery in last-mile logistics
- An active-learning Pareto evolutionary algorithm for parcel locker network design considering accessibility of customers
- Covering delivery problem with electric vehicle and parcel lockers: variable neighborhood search approach
- Robot-aided electric vehicle routing problem with lockers and prime customers prioritization
- Modeling a humanitarian-aid covering tour problem with location selection and vehicle assignment decisions
- Modeling a location and routing problem for mobile lockers in last-mile delivery with horizontal collaboration
- Out-of-home delivery in last-mile logistics: a review
- A unifying framework for selective routing problems
- The covering tour problem with path upgrades
- Vehicle routing problem with roaming locations for simultaneous pickup and delivery services
This page was built for publication: A covering traveling salesman problem with profit in the last mile delivery
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2070135)
