A combined Tabu search and 2-opt heuristic for multiple vehicle routing

Jackson, Justin; Girard, Anouck; Rasmussen, Steven J.; Schumacher, Corey

doi:10.1109/acc.2010.5530677

Cited by 6 publications

(4 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…More recently, Ref. [11] have proposed a tabu search heuristic with 2-opt exchange for a problem with precedence constraints. A simulation study involving two vehicles and 30 tasks was conducted, such that all tasks are performed instantaneously and vehicles are not bound by fuel restrictions.…”

Section: Solution Approaches For Related Problemsmentioning

confidence: 99%

See 1 more Smart Citation

A branch‐and‐bound‐based solution approach for dynamic rerouting of airborne platforms

Murray

Karwan

2013

Naval Research Logistics

View full text Add to dashboard Cite

This article is a sequel to a recent article that appeared in this journal, "An extensible modeling framework for dynamic reassignment and rerouting in cooperative airborne operations" [17], in which an integer programming formulation to the problem of rescheduling in-flight assets due to changes in battlespace conditions was presented. The purpose of this article is to present an improved branch-and-bound procedure to solve the dynamic resource management problem in a timely fashion, as in-flight assets must be quickly re-tasked to respond to the changing environment. To facilitate the rapid generation of attractive updated mission plans, this procedure uses a technique for reducing the solution space, supports branching on multiple decision variables simultaneously, incorporates additional valid cuts to strengthen the minimal network constraints of the original mathematical model, and includes improved objective function bounds. An extensive numerical analysis indicates that the proposed approach significantly outperforms traditional branch-and-bound methodologies and is capable of providing improved feasible solutions in a limited time. Although inspired by the dynamic resource management problem in particular, this approach promises to be an effective tool for solving other general types of vehicle routing problems.

show abstract

Section: Solution Approaches For Related Problemsmentioning

confidence: 99%

“…In Constraint (10) below, x RNP j = 1 if a predecessor task k is performed. Constraint (11) ensures that the appropriate number of resources are assigned to task j , provided that predecessor task k is performed. As with the other task types, an RNP task cannot be performed multiple times by the same resource, as in Constraint (12).…”

Section: Task Constraintsmentioning

confidence: 99%

A branch‐and‐bound‐based solution approach for dynamic rerouting of airborne platforms

Murray

Karwan

2013

Naval Research Logistics

View full text Add to dashboard Cite

show abstract

“…In order to judge their effectiveness, it is desirable to compare them against an algorithm that produces an optimal solution to the given assignment problem. This work discusses a new and effective heuristic used to solve a practical variant of the VRP [12]. This method is compared with one that is provably optimal [13].…”

Section: Introductionmentioning

confidence: 99%

Comparison of Tabu/2‐opt heuristic and optimal tree search method for assignment problems

Jackson

Faied

Girard

2011

Intl J Robust & Nonlinear

View full text Add to dashboard Cite

SUMMARYA nonlinear cooperative control problem involving several vehicles is detailed and solved. The vehicles must be assigned to perform many tasks such that they obey constraints on the order of task completion and minimize a nonlinear objective function, the total time to finish all tasks. This is an example of a combinatorial task assignment problem. A novel heuristic is introduced that represents a new combination of two combinatorial optimization tools. The quality of the solutions produced by this heuristic is demonstrated through comparison with a branch and bound search method. The branch and bound method is a well-known procedure and finds optimal solutions to the constrained, nonlinear task assignment problem.

show abstract

“…The above process represents one generation in the evolution, so the above process is iterated until the preset maximum evolution generation is reached, thereby obtaining a series of optimal decision variables and ultimately attaining the optimal static task preallocation scheme. After obtaining the solution, we apply the 2-optimization (2-opt) [54] operator to locally optimize the reconnaissance sequence q, thereby preventing the intersection of flight paths.…”

mentioning

confidence: 99%

Coordinated Multi-UAV Reconnaissance Scheme for Multiple Targets

Lu,

Qiu,

Guan

et al. 2023

Applied Sciences

View full text Add to dashboard Cite

This study addresses dynamic task allocation challenges in coordinated surveillance involving multiple unmanned aerial vehicles (UAVs). A significant concern is the increased UAV flight distance resulting from the assignment of new missions, leading to decreased reconnaissance efficiency. To tackle this issue, we introduce a collaborative multi-target and multi-UAV reconnaissance scheme. Initially, the multitasking constrained multi-objective optimization framework (MTCOM) is employed to optimize task allocation and reconnaissance time in static scenarios. Subsequently, in case of emergency, we iteratively refine the outcomes of static task allocation through an enhanced auction-based distributed algorithm, effectively reducing UAV flight costs in response to new missions, UAV withdrawal, or damage. Simulation results demonstrate the efficacy of our proposed multi-UAV and multi-target cooperative reconnaissance scheme in resolving dynamic task allocation issues. Additionally, our approach achieves a 5.4% reduction in UAV flight distance compared to traditional allocation methods. The main contribution of this paper is to consider a dynamic scenario model involving UAV damage and the emergence of new reconnaissance areas. Then we propose an innovative collaborative multi-target and multi-UAV reconnaissance scheme to address this issue and, finally, conduct experimental simulations to verify the effectiveness of the algorithm.

show abstract

A combined Tabu search and 2-opt heuristic for multiple vehicle routing

Cited by 6 publications

References 15 publications

A branch‐and‐bound‐based solution approach for dynamic rerouting of airborne platforms

A branch‐and‐bound‐based solution approach for dynamic rerouting of airborne platforms

Comparison of Tabu/2‐opt heuristic and optimal tree search method for assignment problems

Coordinated Multi-UAV Reconnaissance Scheme for Multiple Targets

Contact Info

Product

Resources

About