Similar Search Results

Design of Heuristic Algorithms for Hard Optimization : With Python Codes for the Travelling Salesman Problem

Taillard, Éric D. - 2023

Part I: Combinatorial Optimization, Complexity Theory and Problem Modelling -- 1. Elements of Graphs and Complexity … Theory -- 2. A Short List of Combinatorial Optimization Problems -- 3. Problem Modelling -- Part II: Basic Heuristic … chapters reviewing the basics of combinatorial optimization and complexity theory make the book self-contained. As such, even …

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

UAV routing for reconnaissance mission : a multi-objective orienteering problem with time-dependent prizes and multiple connections

Dasdemir, Erdi; Batta, Rajan; Köksalan, Murat; … - In: Computers & operations research : and their … 145 (2022), pp. 1-17

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

Dynamic Programming Methodologies in Very Large Scale Neighborhood Search Applied to the Traveling Salesman Problem

Ergun, Ozlem; Orlin, James B. - 2006

We provide two different neighborhood construction techniques for creating exponentially large neighborhoods that are searchable in polynomial time using dynamic programming. We illustrate both of these approaches on very large scale neighborhood search techniques for the traveling salesman...

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

New strategy for anti-loop formulations

García Sánchez, José Manuel - In: Opsearch : journal of the Operational Research Society … 61 (2024) 4, pp. 2346-2359

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

Exact algorithms for the Equitable Traveling Salesman Problem

Kinable, Joris; Smeulders, Bart; Delcour, Eline; … - In: European journal of operational research : EJOR 261 (2017) 2, pp. 475-485

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

A branch-and-price algorithm for a team orienteering problem with fixed-wing drones

Sundar, Kaarthik; Sanjeevi, Sujeevraja; Montez, Christopher - In: EURO journal on transportation and logistics 11 (2022), pp. 1-12

This paper formulates a team orienteering problem with multiple fixed-wing drones and develops a branch-and-price algorithm to solve the problem to optimality. Fixed-wing drones, unlike rotary drones, have kinematic constraints associated with them, thereby preventing them to make on-the-spot...

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

Decremental state-space relaxations for the basic traveling salesman problem with a drone

Blufstein, Marcos; Lera-Romero, Gonzalo; Soulignac, … - In: INFORMS journal on computing : JOC ; charting new … 36 (2024) 4, pp. 1064-1083

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

Exact algorithms for the traveling salesman problem with draft limits

Battarra, Maria; Pessoa, Artur; Subramanian, Anand; … - In: European journal of operational research : EJOR 235 (2014) 1, pp. 115-128

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

Lower bounding procedure for the asymmetric quadratic traveling salesman problem

Rostami, Borzou; Malucelli, Federico; Belotti, Pietro; … - In: European journal of operational research : EJOR 253 (2016) 3, pp. 584-592

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

A column generation-based heuristic for a rehabilitation patient scheduling and routing problem

Xaio, Liyang; Zhen, Lu; Laporte, Gilbert; Baldacci, Roberto - In: Computers & operations research : and their … 148 (2022), pp. 1-19

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