Kris Braekers

Orcid: 0000-0001-6052-6846

According to our database1, Kris Braekers authored at least 28 papers between 2013 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
Analyzing the benefits of a city hub: An inventory and routing perspective.
Comput. Ind. Eng., November, 2023

The Electric Dial-a-Ride Problem on a Fixed Circuit.
Transp. Sci., May, 2023

In pursuit of humanised order picking planning: methodological review, literature classification and input from practice.
Int. J. Prod. Res., May, 2023

Integrated scheduling of order picking operations under dynamic order arrivals.
Int. J. Prod. Res., May, 2023

2022
Analysing the effectiveness of workload balancing measures in order picking operations.
Int. J. Prod. Res., 2022

Bi-objective optimization of e-grocery deliveries considering food quality losses.
Comput. Ind. Eng., 2022

2021
Analyzing the benefits of an integrated mobility system using a matheuristic routing algorithm.
Eur. J. Oper. Res., 2021

2020
Operational workload balancing in manual order picking.
Comput. Ind. Eng., 2020

2019
Quality of input data in emergency department simulations: Framework and assessment techniques.
Simul. Model. Pract. Theory, 2019

The value of integrating order picking and vehicle routing decisions in a B2C e-commerce environment.
Int. J. Prod. Res., 2019

Formulating and solving the integrated batching, routing, and picker scheduling problem in a real-life spare parts warehouse.
Eur. J. Oper. Res., 2019

Simulation of emergency department operations: A comprehensive review of KPIs and operational improvements.
Comput. Ind. Eng., 2019

2018
A multi-objective approach for intermodal train load planning.
OR Spectr., 2018

2017
Iterated local search for the capacitated vehicle routing problem with sequence-based pallet loading and axle weight constraints.
Networks, 2017

Multi-directional local search for a bi-objective dial-a-ride problem in patient transportation.
Comput. Oper. Res., 2017

A hybrid Genetic Algorithm for the Heterogeneous Dial-A-Ride Problem.
Comput. Oper. Res., 2017

Operational effects of service level variations for the dial-a-ride problem.
Central Eur. J. Oper. Res., 2017

Typology and literature review for dial-a-ride problems.
Ann. Oper. Res., 2017

2016
A bi-objective home care scheduling problem: Analyzing the trade-off between costs and client inconvenience.
Eur. J. Oper. Res., 2016

Capacitated vehicle routing problem with sequence-based pallet loading and axle weight constraints.
EURO J. Transp. Logist., 2016

The vehicle routing problem: State of the art classification and review.
Comput. Ind. Eng., 2016

Optimizing Train Load Planning: Review and Decision Support for Train Planners.
Proceedings of the Computational Logistics - 7th International Conference, 2016

Improving Order Picking Efficiency by Analyzing Combinations of Storage, Batching, Zoning, and Routing Policies.
Proceedings of the Computational Logistics - 7th International Conference, 2016

2015
Vehicle routing problems with loading constraints: state-of-the-art and future directions.
OR Spectr., 2015

An exact algorithm for the full truckload pick-up and delivery problem with time windows: concept and implementation details.
Int. J. Comput. Aided Eng. Technol., 2015

2013
Integrated planning of loaded and empty container movements.
OR Spectr., 2013

Optimal shipping routes and vessel size for intermodal barge transport with empty container repositioning.
Comput. Ind., 2013

Optimization of empty container movements in intermodal transport.
4OR, 2013


  Loading...