Similar Search Results

Analysis of the Traveling Salesman Problem with Flexible Colors

Roemer, Thomas - 2010

This paper analizes a new variant of the Traveling Salesman Problem (TSP) in which nodes belong to various color classes and each color class must be visited as an entity. We show that the problem is APX-hard and provide exact solutions for special cases and a two-phase heuristic for the general...

Persistent link: https://www.econbiz.de/10013146709

An Enhanced Branch-and-Price-and-Cut Algorithm for the Multi-Trip Vehicle Routing Problem with Time Windows

Hu, Hongjian; Qin, Hu; Xu, Gangyan; Huang, Nan; He, Peiyang - 2023

In this paper, we study the capacitated multi-trip vehicle routing problem with time windows (CMTVRPTW) and its use in …, this feature makes solving the problem more challenging than the capacitated vehicle routing problem with time windows … (CVRPTW). To solve this problem, we propose a novel branch-and-price-and-cut (BPC) algorithm based on the trip-based set …

Persistent link: https://www.econbiz.de/10014361145

A solution technique for capacitated two-level hierarchical time minimization transportation problem

Ding, Hui; Xie, Fanrong - In: Computers & operations research : and their … 151 (2023), pp. 1-29

Persistent link: https://www.econbiz.de/10014234936

Efficient feasibility checks and an adaptive large neighborhood search algorithm for the time-dependent green vehicle routing problem with time windows

Liu, Yiming; Roberto, Baldacci; Zhou, Jianwen; Yu, Yang; … - In: European journal of operational research : EJOR 310 (2023) 1, pp. 133-155

Persistent link: https://www.econbiz.de/10014339669

An asymmetric traveling salesman problem based matheuristic algorithm for flowshop group scheduling problem

He, Xuan; Pan, Quan Ke; Gao, Liang; Neufeld, Janis S. - In: European journal of operational research : EJOR 310 (2023) 2, pp. 597-610

Persistent link: https://www.econbiz.de/10014340278

Human-centric parcel delivery at deutsche post with operations research and machine learning

Arıkan, Uğur; Kranz, Thorsten; Sal, Baris Cem; … - In: INFORMS journal on applied analytics 53 (2023) 5, pp. 359-371

Persistent link: https://www.econbiz.de/10014383168

A fill-and-reduce greedy algorithm for the container pre-marshalling problem

Araya, Ignacio; Toledo, Martín - In: Operational research : an international journal 23 (2023) 3, pp. 1-29

Persistent link: https://www.econbiz.de/10014364568

Swarm intelligence and nature inspired algorithms for solving vehicle routing problems : a survey

Stamadianos, Themistoklis; Taxidou, Andromachi; … - In: Operational research : an international journal 24 (2024) 3, pp. 1-45

Persistent link: https://www.econbiz.de/10015135653

RoutingBlocks : an open-source Python package for vehicle routing problems with intermediate stops

Klein, Patrick S.; Schiffer, Maximilian - In: INFORMS journal on computing : JOC ; charting new … 36 (2024) 4, pp. 966-973

Persistent link: https://www.econbiz.de/10015163693

A reactive tabu search algorithm for the multi-depot container truck transportation problem

Zhang, Ruiyou; Yun, Won Young; Moon, Ilkyeong - In: Transportation research / E : an international journal 45 (2009) 6, pp. 904-914

Persistent link: https://www.econbiz.de/10003903735