A variable neighborhood search heuristic algorithm for the double vehicle routing problem with multiple stacks
From MaRDI portal
Publication:6088235
DOI10.1111/itor.12623OpenAlexW2906854512MaRDI QIDQ6088235
Unnamed Author, Unnamed Author, Jonatas B. C. Chagas, Marcone Jamilson Freitas Souza
Publication date: 16 November 2023
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/itor.12623
vehicle routingvariable neighborhood searchloading constraintspickup and deliverymathematical formulation
Related Items
Less is more approach: basic variable neighborhood search for the obnoxious p‐median problem ⋮ The uncapacitated r‐allocation p‐hub center problem ⋮ The double traveling salesman problem with partial last‐in‐first‐out loading constraints ⋮ A variable neighborhood search for flying sidekick traveling salesman problem ⋮ A game‐theoretic approach for the location of terror response facilities with both disruption risk and hidden information ⋮ Heuristic feeder‐bus operation strategy considering weather information: a chance‐constrained model ⋮ Approximation of the double traveling salesman problem with multiple stacks
Cites Work
- A variable neighborhood search for the capacitated vehicle routing problem with two-dimensional loading constraints
- Exact algorithms for the double vehicle routing problem with multiple stacks
- Heuristic and exact algorithms for the multi-pile vehicle routing problem
- The double traveling salesman problem with multiple stacks: A variable neighborhood search approach
- The double travelling salesman problem with multiple stacks - formulation and heuristic solution approaches
- Variable neighborhood search
- Polyhedral results and a branch-and-cut algorithm for the double traveling salesman problem with multiple stacks
- Efficient algorithms for the double traveling salesman problem with multiple stacks
- An efficient genetic algorithm for the traveling salesman problem with precedence constraints
- New formulation and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks
- An exact method for the double TSP with multiple stacks
- A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading
- Exact solutions to the double travelling salesman problem with multiple stacks
- The General Pickup and Delivery Problem
- A branch‐and‐cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks
- Variable neighborhood search: Principles and applications
- Variable neighborhood search algorithms for the vehicle routing problem with two‐dimensional loading constraints and mixed linehauls and backhauls
- Skewed general variable neighborhood search for the cumulative capacitated vehicle routing problem
