Said Dabia

Said Dabia

Auto-generated profile, based on publicly available information

Said Dabia

Department of Operations Analytics, Vrije Universiteit Amsterdam, 1081 HV Amsterdam, Netherlands

Research Focus & Metrics

Academic Career Length

16Years (2011-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 August 2013 in Transportation Science
Verified
Journal Article
Closed access
SDSaid Dabia
Said Dabia
SRStefan Ropke
Stefan Ropke
Tom Van WoenselTom Van Woensel
Tom Van Woensel
TKTon De Kok
Ton De Kok
This paper presents a branch-and-price algorithm for the time-dependent vehicle routing problem with time windows (TDVRPTW). We capture road congestion by considering time-dependent travel times, i.e., depending on the departure time to a customer, a different travel time is incurred. We consider the variant of the TDVRPTW where the objective is to minimize total route duration and denote this variant the duration minimizing TDVRPTW (DM-TDVRPTW). Because of time dependency, vehicles' dispatch times at the depot are crucial as road congestion might be avoided. Because of its complexity, all known solution methods to the DM-TDVRPTW are based on (meta-)heuristics. The decomposition of an arc-based formulation leads to a set-partitioning problem as the master problem, and a time-dependent shortest path problem with resource constraints as the pricing problem. The master problem is solved by means of column generation, and a tailored labeling algorithm is used to solve the pricing problem. We introduce new dominance criteria that allow more label dominance. For our numerical results, we modified Solomon's data sets by adding time dependency. Our algorithm is able to solve about 63% of the instances with 25 customers, 38% of the instances with 50 customers, and 15% of the instances with 100 customers.

1 May 2017 in Transportation Science
Verified
Journal Article
Closed access
SDSaid Dabia
Said Dabia
EDEmrah Demir
Emrah Demir
Tom Van WoenselTom Van Woensel
Tom Van Woensel
The pollution-routing problem (PRP) is a recently introduced green vehicle routing problem in the field of green logistics. It concerns routing a number of vehicles to serve a set of geographically dispersed customers within their time windows, jointly with determining their speed on each arc so as to minimize fuel and driving costs. Because of its complexity, all known solution methods are based on (meta-)heuristics. This paper presents an exact solution based on a branch-and-price algorithm for a variant of the PRP. The master problem is a set-partitioning problem, and the pricing problem is a speed- and start-time elementary shortest path problem with resource constraints, in which the speed and start time at the depot needs to be decided on for each individual route. The master problem is solved by means of column generation, and a tailored labeling algorithm is used to solve the pricing problem. New dominance criteria are developed to discard unpromising labels by exploiting the structure of the ready time and the fuel consumption functions. Extensive computational experiments show the value of the proposed algorithm.

1 March 2018 in Transportation Science
Verified
Journal Article
Closed access
RSRemy Spliet
Remy Spliet
SDSaid Dabia
Said Dabia
Tom Van WoenselTom Van Woensel
Tom Van Woensel
In this paper, we introduce the time window assignment vehicle routing problem (TWAVRP) with time-dependent travel times. It is the problem of assigning time windows to customers before their demand is known and creating vehicle routes adhering to these time windows after demand becomes known. The goal is to assign the time windows in such a way that the expected transportation costs are minimized. We develop a branch-price-and-cut algorithm to solve this problem to optimality. The pricing problem that has to be solved is a new variant of the shortest path problem, which includes a capacity constraint, time-dependent travel times, time window constraints on both the nodes and on the arcs, and linear node costs. For solving the pricing problem, we develop an exact labeling algorithm and a tabu search heuristic. Furthermore, we present new valid inequalities, which are specifically designed for the TWAVRP with time-dependent travel times. Finally, we present results of numerical experiments to illustrate the performance of the algorithm.

1 February 2018 in European Journal of Operational Research
Verified
Journal Article
Closed access
PSPeng Sun
Peng Sun
LVLucas P. Veelenturf
Lucas P. Veelenturf
SDSaid Dabia
Said Dabia
Tom Van WoenselTom Van Woensel
Tom Van Woensel

1 September 2011 in International Journal of Production Economics
Verified
Journal Article
Closed access
GKG.P. Kiesmüller
G.P. Kiesmüller
AKA.G. de Kok
A.G. de Kok
SDS. Dabia
S. Dabia

1 July 2019 in Transportation Science
Verified
Journal Article
Closed access
SDSaid Dabia
Said Dabia
DLDavid Lai
David Lai
DVDaniele Vigo
Daniele Vigo
The vehicle routing problem with private fleet and common carrier (VRPPC) is a generalization of the classical vehicle routing problem in which the owner of a private fleet can either visit a customer with one of the owner’s vehicles or assign the customer to a common carrier. The latter case occurs if the demand exceeds the total capacity of the private fleet or if it is more economically convenient to do so. The owner’s objective is to minimize the variable and fixed costs for operating the owner’s fleet plus the total cost charged by the common carrier. This family of problems has many practical applications, particularly in the design of last-mile distribution services and has received some attention in the literature, in which some heuristics were proposed. We extend here the VRPPC by considering more realistic cost structures that account for quantity discounts on outsourcing costs and by considering time windows resulting in a rich VRPPC (RVRPPC). We present an exact approach based on a branch-and-cut-and-price algorithm for the RVRPPC and test the algorithm on instances from the literature.