The double traveling salesman problem with partial last‐in‐first‐out loading constraints-Reference-Cited by-同舟云学术

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

Published:2020-09-20 Issue:4 Volume:29 Page:2346-2373
ISSN:0969-6016
Container-title:International Transactions in Operational Research
language:en
Short-container-title:Int Trans Operational Res

Author:

Chagas Jonatas B. C.¹²^ORCID,Toffolo Túlio A. M.¹,Souza Marcone J. F.¹,Iori Manuel³

Affiliation:

1. Departamento de Computação Universidade Federal de Ouro Preto Campus Morro do Cruzeiro s/n Ouro Preto 35.400‐000 Brazil

2. Departamento de Informática Universidade Federal de Viçosa Av. Peter Henry Rolfs, s/n ‐ Campus Universitário Viçosa 36570‐900 Brazil

3. DISMI Universitá degli studi di Modena e Reggio Emilia Via Amendola 2, Pad. Morselli Reggio Emilia 42122 Italy

Funder

Conselho Nacional de Desenvolvimento Científico e Tecnológico

Università Degli Studi di Modena e Reggio Emila

Universidade Federal de Ouro Preto

Fundação de Amparo à Pesquisa do Estado de Minas Gerais

Publisher

Wiley

Subject

Management of Technology and Innovation,Management Science and Operations Research,Strategy and Management,Computer Science Applications,Business and International Management

Link

https://onlinelibrary.wiley.com/doi/pdf/10.1111/itor.12876

Reference43 articles.

1. A Branch-and-Cut Algorithm for the Double Traveling Salesman Problem with Multiple Stacks

2. Polyhedral results and a branch-and-cut algorithm for the double traveling Salesman problem with multiple stacks

3. Chapter 6: Pickup-and-Delivery Problems for Goods Transportation

4. F-Race and Iterated F-Race: An Overview

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Biased random-key genetic algorithms: A review;European Journal of Operational Research;2024-03

2. A branch‐and‐price‐based heuristic for the vehicle routing problem with two‐dimensional loading constraints and time windows;International Transactions in Operational Research;2023-10-07

3. A metaheuristic for the double traveling salesman problem with partial last‐in‐first‐out loading constraints;International Transactions in Operational Research;2022-08-02

4. Valid inequalities and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks;European Journal of Operational Research;2021-08

5. Additive Bounds for the Double Traveling Salesman Problem with Multiple Stacks;AIRO Springer Series;2021