Multi-vehicle coordination and flexible scheduling based on Simulated Annealing Algorithm

Author

Cheng Zhu ; Luohao Tang ; Weiming Zhang

Author_Institution

Sci. & Technol. on Inf. Syst. Eng. Lab., Nat. Univ. of Defense Technol., Changsha, China

fYear

2014

fDate

May 31 2014-June 2 2014

Firstpage

2686

Lastpage

2691

Abstract

In this paper, we consider a multi-vehicle coordination problem (MVCP), in which heterogeneous vehicles with different resources cooperate to accomplish a set of tasks. The distinct characters of MVCP are the duration of each task may vary within a given interval, and the objective is to allocate and schedule the vehicles to maximize the total time slacks between tasks given the deadline. The time slack represents the fleet´s capability to tolerate the temporal uncertainty. A model for MVCP is built and a solving method based on the Simulated Annealing Algorithm is proposed. The result of experiments shows the efficiency of the method.

Keywords

scheduling; simulated annealing; vehicle routing; MVCP; flexible scheduling; multivehicle coordination problem; simulated annealing; temporal uncertainty; time slack; Algorithm design and analysis; Heuristic algorithms; Resource management; Routing; Schedules; Simulated annealing; Vehicles; Simulated Annealing Algorithm; multi-vehicle coordination; varying duration;

fLanguage

English

Publisher

ieee

Conference_Titel

Control and Decision Conference (2014 CCDC), The 26th Chinese

Conference_Location

Changsha

Print_ISBN

978-1-4799-3707-3

Type

conf

DOI

10.1109/CCDC.2014.6852627

Filename

6852627