Search
Search Results
-
On the shortest \(\alpha\)-reliable path problem
In this variant of the constrained shortest path problem, the time of traversing an arc is given by a non-negative continuous random variable. The...
-
Multi-drill path sequencing models: A comparative study
In multi-hole drilling, optimization of the drill-path sequencing can lead to a significant reduction in machining time and eventually improves...
-
Partial dominance in branch-price-and-cut algorithms for vehicle routing and scheduling problems with a single-segment tradeoff
For many variants of vehicle routing and scheduling problems solved by a branch-price-and-cut (BPC) algorithm, the pricing subproblem is an...
-
The urban air mobility problem
Over the next two decades, Urban Air Mobility (UAM) Systems are anticipated to revolutionize the mass transportation industry. As envisioned...
-
A column generation approach for the driver scheduling problem with staff cars
Given a set of timetabled bus trips, transport companies are faced with the challenge of finding a feasible driver schedule that covers all trips and...
-
Analysis of the shortest relay queue policy in a cooperative random access network with collisions
The aim of this work concerns the performance analysis of systems with interacting queues under the join the shortest queue policy. The case of two...
-
Instability of SRPT, SERPT and SJF multiclass queueing networks
We provide two examples of strictly subcritical multiclass queueing networks which are unstable under the shortest remaining processing time (SRPT)...
-
A Short List of Combinatorial Optimization Problems
This chapter reviews a number of typical combinatorial optimization problems. It illustrates the tenuous border that sometimes exists between an easy...
-
Joint optimisation of drone routing and battery wear for sustainable supply chain development: a mixed-integer programming model based on blockchain-enabled fleet sharing
Alongside the rise of ‘last-mile’ delivery in contemporary urban logistics, drones have demonstrate commercial potential, given their outstanding...
-
Network Design with Routing Requirements
Many practical applications of network design, particularly in transportation and logistics, require designing a cost-effective network configuration...
-
Solving stochastic frequency-based assignment to transit networks with pre-trip/en-route path choice
This paper deals with the stochastic frequency-based assignment for transit systems, considering pre-trip/en-route path choice behaviour; this...
-
Multi-commodity flow problem on lossy network with partial lane reversals
During the transmission of several different commodities from respective sources to the sinks, there may be loss due to leakage, evaporation, or...
-
Elements of Graphs and Complexity Theory
This chapter recalls some elements and definitions in graph theory and complexity theory. On the one hand, basic algorithmic courses very often...
-
Public transport crowdship**: moving shipments among parcel lockers located at public transport stations
In view of success stories of unicorn startups from the sharing and gig economy such as Airbnb, DiDi, or Uber, it is not surprising that postal...
-
Extended formulation and Branch-and-Cut-and-Price algorithm for the two connected subgraph problem with disjunctive constraints
A graph is said to be two connected if between every pair of nodes there are at least two node-disjoint paths. Given weights on the edges of the...
-
Decision space robustness for multi-objective integer linear programming
In this article we introduce robustness measures in the context of multi-objective integer linear programming problems. The proposed measures are in...
-
Local Search
Improvement methods constitute the backbone of most metaheuristics. These methods repeatedly perform slight, local modifications on a current...
-
Constructive Methods
This chapter presents methods for constructing solutions. It starts with the branch and bound methods, widely used for the design of exact...
-
Fair User Equilibrium in a Transportation Space-Time Network
Central in this chapter is a transportation network, in which containers are transported for multiple agents. This network is modelled by a...
-
Fixed-Charge Network Design Problems
This chapter introduces problems and models that involve design decisions captured with arc-based binary variables that typically model fixed costs....