Wout Dullaert

Orcid: 0000-0002-9416-211X

According to our database1, Wout Dullaert authored at least 39 papers between 2002 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Incorporating product decay during transportation and storage into a sustainable inventory model.
Comput. Ind. Eng., November, 2023

A memetic algorithm for solving rich waste collection problems.
Eur. J. Oper. Res., July, 2023

2022
ATM cash replenishment under varying population coverage requirements.
J. Oper. Res. Soc., 2022

2021
The Robust Vehicle Routing Problem with Time Window Assignments.
Transp. Sci., 2021

The Inventory Routing Problem with Demand Moves.
Oper. Res. Forum, 2021

2020
The Team Orienteering Problem with Overlaps: An Application in Cash Logistics.
Transp. Sci., 2020

Efficient Neighborhood Evaluations for the Vehicle Routing Problem with Multiple Time Windows.
Transp. Sci., 2020

The Vehicle Routing Problem with Partial Outsourcing.
Transp. Sci., 2020

An Exact Solution Framework for Multitrip Vehicle-Routing Problems with Time Windows.
Oper. Res., 2020

A graph-based formulation for the shift rostering problem.
Eur. J. Oper. Res., 2020

2019
Vehicle routing with arrival time diversification.
Eur. J. Oper. Res., 2019

The Dynamic-Demand Joint Replenishment Problem with Approximated Transportation Costs.
Eur. J. Oper. Res., 2019

2018
An Efficient Implementation of a Static Move Descriptor-based Local Search Heuristic.
Comput. Oper. Res., 2018

2017
Route and fleet design for cyclic inventory routing.
Eur. J. Oper. Res., 2017

2016
A service network design model for multimodal municipal solid waste transport.
Eur. J. Oper. Res., 2016

2015
Location and Distribution Management of Relief Centers: A Genetic Algorithm Approach.
Int. J. Inf. Technol. Decis. Mak., 2015

2013
An Efficient Implementation of a Static Move Descriptor-based Local Search Heuristic.
Proceedings of the ICORES 2013, 2013

The Berth Allocation and Quay Crane Assignment Problem Using a CP Approach.
Proceedings of the Principles and Practice of Constraint Programming, 2013

2012
A multi-attribute Systemic Risk Index for comparing and prioritizing chemical industrial areas.
Reliab. Eng. Syst. Saf., 2012

Cardinality Reasoning for Bin-Packing Constraint: Application to a Tank Allocation Problem.
Proceedings of the Principles and Practice of Constraint Programming, 2012

2011
An enriched model for the integrated berth allocation and quay crane assignment problem.
Expert Syst. Appl., 2011

2010
Using a TSP heuristic for routing order pickers in warehouses.
Eur. J. Oper. Res., 2010

A memetic algorithm for bi-objective integrated forward/reverse logistics network design.
Comput. Oper. Res., 2010

A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows.
Comput. Oper. Res., 2010

2009
An upper bound on the cycle time of a stochastic marked graph using incomplete information on the transition firing time distributions.
Math. Comput. Model., 2009

An optimization approach for communal home meal delivery service: A case study.
J. Comput. Appl. Math., 2009

MamMoeT: An intelligent agent-based communication support platform for multimodal transport.
Expert Syst. Appl., 2009

A well-scalable metaheuristic for the fleet size and mix vehicle routing problem with time windows.
Expert Syst. Appl., 2009

2008
An Effective Multirestart Deterministic Annealing Metaheuristic for the Fleet Size and Mix Vehicle-Routing Problem with Time Windows.
Transp. Sci., 2008

Knock-on accident prevention in a chemical cluster.
Expert Syst. Appl., 2008

2007
A multi-parametric evolution strategies algorithm for vehicle routing problems.
Expert Syst. Appl., 2007

An Evolutionary Algorithm and discrete event simulation for optimizing inspection strategies for multi-stage processes.
Eur. J. Oper. Res., 2007

Applications of metaheuristics.
Eur. J. Oper. Res., 2007

2005
A Hybrid Approach to Designing Inbound-Resupply Strategies.
IEEE Intell. Syst., 2005

An evolutionary algorithm for order splitting with multiple transport alternatives.
Expert Syst. Appl., 2005

2004
Evolutionary Algorithms for the Vehicle Routing Problem with Time Windows.
J. Heuristics, 2004

A multi-start local search algorithm for the vehicle routing problem with time windows.
Eur. J. Oper. Res., 2004

2003
A Fast Evolutionary Metaheuristic for the Vehicle Routing Problem with Time Windows.
Int. J. Artif. Intell. Tools, 2003

2002
New heuristics for the Fleet Size and Mix Vehicle Routing Problem with Time Windows.
J. Oper. Res. Soc., 2002


  Loading...