Vehicle Routing Problem with Metric Temporal Logic Specifications

Author

Karaman, Sertac ; Frazzoli, Emilio

Author_Institution

Lab. for Inf. & Decision Syst., Massachusetts Inst. of Technol., Cambridge, MA, USA

fYear

2008

fDate

9-11 Dec. 2008

Firstpage

3953

Lastpage

3958

Abstract

This paper proposes a novel version of the vehicle routing problem (VRP). Instead of servicing all the customers, feasible solutions of the VRP instance are forced to satisfy a set of complex high-level tasks given as a metric temporal logic (MTL) specification, which allows complex quantitative timing constraints to be incorporated into the problem. For the resulting vehicle routing problem with metric temporal logic specifications (VRPMTL), a mixed-integer linear programming (MILP) based algorithm is provided that solves the problem to optimality. Examples for optimal multi-UAV mission planning are provided where MTL is used as a high level language to specify complex mission tasks.

Keywords

integer programming; linear programming; temporal logic; transportation; vehicles; high level language; metric temporal logic specifications; mixed-integer linear programming; optimal multiUAV mission planning; vehicle routing problem; Application software; Heuristic algorithms; High level languages; Linear programming; Logic programming; Natural languages; Packaging; Routing; Timing; Vehicles;

fLanguage

English

Publisher

ieee

Conference_Titel

Decision and Control, 2008. CDC 2008. 47th IEEE Conference on

Conference_Location

Cancun

ISSN

0191-2216

Print_ISBN

978-1-4244-3123-6

Electronic_ISBN

0191-2216

Type

conf

DOI

10.1109/CDC.2008.4739366

Filename

4739366