A metaheuristic for the double traveling salesman problem with partial last‐in‐first‐out loading constraints

DOI10.1111/itor.13189OpenAlexW4289520408MaRDI QIDQ6080619

Unnamed Author, Unnamed Author, Carlos Contreras-Bolton

Publication date: 4 October 2023

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/itor.13189

zbMATH Keywords

metaheuristicloading constraintspickup and deliveryiterated local searchpartial reloading

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Related Items (1)

The multiple container loading problem with loading docks

Cites Work

• Unnamed Item
• The tree representation for the pickup and delivery traveling salesman problem with LIFO loading
• Routing problems with loading constraints
• New neighborhood structures for the double traveling salesman problem with multiple stacks
• 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
• Formulations and algorithms for the pickup and delivery traveling salesman problem with multiple stacks
• Polyhedral results and a branch-and-cut algorithm for the double traveling salesman problem with multiple stacks
• The pickup and delivery traveling salesman problem with handling costs
• Efficient algorithms for the double traveling salesman problem with multiple stacks
• Approximation of the double traveling salesman problem with multiple stacks
• A branch-and-cut algorithm for the split-demand one-commodity pickup-and-delivery travelling salesman problem
• Models and algorithms for the traveling salesman problem with time-dependent service times
• The traveling salesman problem and its variations.
• Valid inequalities and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks
• The Truck Dispatching Problem
• Variable Neighborhood Search for the Pickup and Delivery Traveling Salesman Problem with LIFO Loading
• Vehicle Routing
• 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
• Improved exact method for the double TSP with multiple stacks
• TSPLIB—A Traveling Salesman Problem Library
• Reducibility among Combinatorial Problems
• A branch‐and‐cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks
• A branch‐and‐bound algorithm for the double travelling salesman problem with two stacks
• A Method for Solving Traveling-Salesman Problems
• Computer Solutions of the Traveling Salesman Problem
• A GRASP/Path‐Relinking algorithm for the traveling purchaser problem
• Heuristic approaches for the family traveling salesman problem
• A matheuristic algorithm for the pollution and energy minimization traveling salesman problems
• An Additive Branch-and-Bound Algorithm for the Pickup and Delivery Traveling Salesman Problem with LIFO or FIFO Loading

This page was built for publication: A metaheuristic for the double traveling salesman problem with partial last‐in‐first‐out loading constraints