A multi-vehicle covering tour problem with speed optimization
| Autor: | Joshua T. Margolis, Yongjia Song, Scott J. Mason |
|---|---|
| Rok vydání: | 2019 |
| Předmět: |
050210 logistics & transportation
Schedule Mathematical optimization 021103 operations research Computer Networks and Communications Computer science Heuristic (computer science) 05 social sciences 0211 other engineering and technologies 02 engineering and technology Extension (predicate logic) Set (abstract data type) symbols.namesake Hardware and Architecture Lagrangian relaxation Optimization and Control (math.OC) 0502 economics and business Vehicle routing problem symbols FOS: Mathematics Special case Mathematics - Optimization and Control Software Energy (signal processing) Information Systems |
| DOI: | 10.48550/arxiv.1909.12435 |
| Popis: | The multi-vehicle covering tour problem with time windows (MCTPTW) aims to construct a set of maximal coverage routes for a fleet of vehicles that serve (observe) a secondary set of sites given a fixed time schedule, coverage requirements, and energy restrictions. The problem is formulated as a mixed-integer second-order cone programming (MISOCP) model and is an extension of both the multi-covering tour problem and the vehicle routing problem with time windows under energy constraints. Further, we study a special case of the proposed model and develop a labeling algorithm to solve its Lagrangian relaxation problem, which exploits the combinatorial structure exhibited by an optimal solution to the Lagrangian relaxation. Comment: 37 pages, 7 figures, 6 tables |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|