A Bicriteria Skill Vehicle Routing Problem with Time Windows and an Application to Pushback Operations at Airports

Schwarze, Silvia; Voß, Stefan

doi:10.1007/978-3-319-13177-1_23

Cited by 11 publications

(8 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Early work on this problem was done in [4], who proposed and tested multiple integer linear programming (ILP) formulations on a large set of generated benchmark problems and discussed the applicability of this problem to home care scheduling. [55] also studied this problem and later proposed a variation that utilizes time windows [56,63] also studied a form of the SVRP involving stochastic service times.…”

Section: 2mentioning

confidence: 99%

The synchronized multi-assignment orienteering problem

Garcia¹

2023

JIMO

View full text Add to dashboard Cite

<p style='text-indent:20px;'>We introduce the Synchronized Multi-Assignment Orienteering Problem (SMOP), a vehicle routing problem that requires jointly selecting a set of jobs while synchronizing the assignment and transportation of agents to roles to form ad-hoc teams at different job locations. Agents must be assigned only to roles for which they are qualified. Each job requires a certain number of agents in each role within a time window and contributes a reward score if selected. The task is to maximize the total reward attained. SMOP can model many real-world scenarios requiring coordinated transportation of resources and accommodates traditional depot-based workforces, depot workforces supplemented by ad-hoc workers, and fully ad-hoc workforces alike. The same problem formulation can be used for initial planning and mid-course replanning. We develop a mixed integer programming formulation (MIP) and an Adaptive Large Neighborhood Search algorithm (ALNS). In computational experiments covering a range of considerations, ALNS consistently found very near-optimal solutions on smaller problems and surpassed a commercial MIP solver substantially on larger problems. ALNS also found 24 new best solutions on a set of benchmark problems from the literature for the related Cooperative Orienteering Problem with Time Windows.</p>

show abstract

Section: 2mentioning

confidence: 99%

The synchronized multi-assignment orienteering problem

Garcia¹

2023

JIMO

View full text Add to dashboard Cite

show abstract

“…Various extensions of the Skill VRP have been studied. Schwarze and Voss (2015) presented the so-called Bi-Criteria Skill VRP with (hard) Time Windows for pushback tractors in airport terminals. Let a i , b i ≥ 0 denote the earliest and the latest times during the planning period that service at vertex i ∈ V \ {1} can take place, and let o i denote the time needed to carry out the service at i.…”

Section: Preliminaries and Base Modelmentioning

confidence: 99%

“…Computational experiments with up to 71 service requests and nine skills showed the trade-off in terms of LP bound quality and computational burden. Based on the mathematical models described in Section 2, enhanced bicriteria variants of the single-period Skill VRP with load balancing and time windows were studied in the works of Schwarze and Voss (2013), Schwarze and Voss (2015). In Schwarze and Voss (2013), a minmax approach was proposed by minimising the maximal tour without consideration of total routing costs, and minimising the routing cost while taking the length of a maximal tour as an upper bound on the tour lengths within a distance constrained model.…”

Section: Exact Algorithmsmentioning

confidence: 99%

“…This minmax model improves resource utilisation and load balancing compared with the ordinary Skill VRP. In Schwarze and Voss (2015), the routing cost and the total completion time were enforced as hierarchical objectives. As reported by the authors, the total completion time objective leads to reduced integrality gaps, while it appears that if a routing cost is adopted as the primary objective, the increase in total completion time (with respect to the optimal value) is smaller than that in the routing cost in the reverse case.…”

Section: Exact Algorithmsmentioning

confidence: 99%

See 1 more Smart Citation

Resource constrained routing and scheduling: Review and research prospects

Paraskevopoulos

Laporte

Repoussis

et al. 2017

European Journal of Operational Research

View full text Add to dashboard Cite

In the service industry, it is crucial to efficiently allocate scarce resources to perform tasks and meet particular service requirements. What considerably complicates matters is when these resources, for example skilled technicians, nurses, and home carers have to visit different customer locations. This paper provides a comprehensive survey on resource constrained routing and scheduling that unveils the problem characteristics with respect to resource qualifications, service requirements and problem objectives. It also identifies the most effective exact and heuristic algorithms for this class of problems. The paper closes with several research prospects.

show abstract

“…Another well known application of the re-location (re-balancing) problem is the one that deals with emergency vehicles [17,18]. For vehicle routing problems dealing with specialized technicians, balancing issues in the workload of technicians were modeled in [19] and solved with a bi-objective optimization model [20]. In a military context, planning flights and maintenance of military aircrafts is considered in [21], where flights must be balanced to keep aircrafts intact as long as possible and maintenance operations must be balanced to keep the squadron available at all times.…”

Section: Introductionmentioning

confidence: 99%

The Unit Re-Balancing Problem

2021

View full text Add to dashboard Cite

We describe the problem of re-balancing a number of units distributed over a geographic area. Each unit consists of a number of components. A value between 0 and 1 describes the current rating of each component. By a piecewise linear function, this value is converted into a nominal status assessment. The lowest of the statuses determines the efficiency of a unit, and the highest status its cost. An unbalanced unit has a gap between these two. To re-balance the units, components can be transferred. The goal is to maximize the efficiency of all units. On a secondary level, the cost for the re-balancing should be minimal. We present a mixed-integer nonlinear programming formulation for this problem, which describes the potential movement of components as a multi-commodity flow. The piecewise linear functions needed to obtain the status values are reformulated using inequalities and binary variables. This results in a mixed-integer linear program, and numerical standard solvers are able to compute proven optimal solutions for instances with up to 100 units. We present numerical solutions for a set of open test instances and a bi-criteria objective function, and discuss the trade-off between cost and efficiency.

show abstract

A Bicriteria Skill Vehicle Routing Problem with Time Windows and an Application to Pushback Operations at Airports

Cited by 11 publications

References 7 publications

The synchronized multi-assignment orienteering problem

The synchronized multi-assignment orienteering problem

Resource constrained routing and scheduling: Review and research prospects

The Unit Re-Balancing Problem

Contact Info

Product

Resources

About