All Stories

  1. Analyzing the benefits of a city hub: An inventory and routing perspective
  2. The Electric Dial-a-Ride Problem on a Fixed Circuit
  3. In pursuit of humanised order picking planning: methodological review, literature classification and input from practice
  4. Integrated scheduling of order picking operations under dynamic order arrivals
  5. Bi-objective optimization of e-grocery deliveries considering food quality losses
  6. Uncertainty in Intermodal and Synchromodal Transport: Review and Future Research Directions
  7. Analyzing the benefits of an integrated mobility system using a matheuristic routing algorithm
  8. Analysing the effectiveness of workload balancing measures in order picking operations
  9. Parameter tuning of a local search heuristic for a vehicle routing problem with loading constraints
  10. Improving emergency department performance by revising the patient–physician assignment process
  11. Operational workload balancing in manual order picking
  12. Formulating and solving the integrated batching, routing, and picker scheduling problem in a real-life spare parts warehouse
  13. Designing efficient order picking systems: The effect of real-life features on the relationship among planning problems
  14. Simulation of emergency department operations: A comprehensive review of KPIs and operational improvements
  15. Intermodal Container Routing: Integrating Long-Haul Routing and Local Drayage Decisions
  16. Quality of input data in emergency department simulations: Framework and assessment techniques
  17. The value of integrating order picking and vehicle routing decisions in a B2C e-commerce environment
  18. Increasing order picking efficiency by integrating storage, batching, zone picking, and routing policy decisions
  19. A Fuzzy Measure of Vulnerability for the Optimization of Vehicle Routing Problems With Time Windows
  20. A multi-objective approach for intermodal train load planning
  21. Benefits of horizontal cooperation in dial-a-ride services
  22. Typology and literature review for dial-a-ride problems
  23. A hybrid Genetic Algorithm for the Heterogeneous Dial-A-Ride Problem
  24. Iterated local search for the capacitated vehicle routing problem with sequence-based pallet loading and axle weight constraints
  25. Multi-directional local search for a bi-objective dial-a-ride problem in patient transportation
  26. A multi-period dial-a-ride problem with driver consistency
  27. Three effective metaheuristics to solve the multi-depot multi-trip heterogeneous dial-a-ride problem
  28. The vehicle routing problem: State of the art classification and review
  29. A bi-objective home care scheduling problem: Analyzing the trade-off between costs and client inconvenience
  30. Improving Order Picking Efficiency by Analyzing Combinations of Storage, Batching, Zoning, and Routing Policies
  31. Optimizing Train Load Planning: Review and Decision Support for Train Planners
  32. Assessing the impact of different policy decisions on the resource requirements of a Demand Responsive Transport system for persons with disabilities
  33. Operational effects of service level variations for the dial-a-ride problem
  34. An exact algorithm for the full truckload pick-up and delivery problem with time windows: concept and implementation details
  35. Vehicle routing problems with loading constraints: state-of-the-art and future directions
  36. Capacitated vehicle routing problem with sequence-based pallet loading and axle weight constraints
  37. Exact and meta-heuristic approach for a general heterogeneous dial-a-ride problem with multiple depots
  38. Bi-objective optimization of drayage operations in the service area of intermodal terminals
  39. Optimal shipping routes and vessel size for intermodal barge transport with empty container repositioning
  40. Optimization of empty container movements in intermodal transport
  41. Integrated planning of loaded and empty container movements
  42. Challenges in Managing Empty Container Movements at Multiple Planning Levels
  43. A Deterministic Annealing Algorithm for a Bi-Objective Full Truckload Vehicle Routing Problem in Drayage Operations