The double traveling salesman problem with partial last‐in‐first‐out loading constraints

DOI10.1111/itor.12876arXiv1908.08494OpenAlexW3087489755MaRDI QIDQ6071059

Túlio A. M. Toffolo, Jonatas B. C. Chagas, Manuel Iori, Marcone Jamilson Freitas Souza

Publication date: 27 November 2023

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

Full work available at URL: https://arxiv.org/abs/1908.08494

zbMATH Keywords

genetic algorithmmathematical modelsloading constraintspickup and deliverypartial reloading

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Related Items

A branch‐and‐price‐based heuristic for the vehicle routing problem with two‐dimensional loading constraints and time windows

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A biased random-key genetic algorithm for the unequal area facility layout problem
• Exact algorithms for the double vehicle routing problem with multiple stacks
• The tree representation for the pickup and delivery traveling salesman problem with LIFO loading
• Routing problems with loading constraints
• 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
• A parallel multi-population biased random-key genetic algorithm for a container loading problem
• Efficient algorithms for the double traveling salesman problem with multiple stacks
• Biased random-key genetic algorithms with applications in telecommunications
• Variable Neighborhood Search for the Pickup and Delivery Traveling Salesman Problem with LIFO Loading
• 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
• Non-Elementary Formulations for Single Vehicle Routing Problems with Pickups and Deliveries
• A dynamic programming based local search approach for the double traveling salesman problem with multiple stacks
• 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 variable neighborhood search heuristic algorithm for the double vehicle routing problem with multiple stacks
• An Additive Branch-and-Bound Algorithm for the Pickup and Delivery Traveling Salesman Problem with LIFO or FIFO Loading