A multilevel variable neighborhood search heuristic for a practical vehicle routing and driver scheduling problem

Affordable Access

A multilevel variable neighborhood search heuristic for a practical vehicle routing and driver scheduling problem

Authors
Publisher
John/Wiley & Sons, Inc. John/Wiley & Sons Ltd.
Keywords
  • Thereafter
  • Finally
  • Among Other Things
  • Heterogeneous Vehicles
  • These Regulations Include
  • Predefined Workdays
  • Fixed Starting Time
  • Maximum Weekly Working Duration
  • The Problem Size Is Reduced Through An Aggregation Procedure
  • The Aggregated Weekly Planning Problem Is Decomposed Into Daily Planning Problems
  • Each Of Which Is Solved By A Variable Neighborhood Search
  • The Solution Of The Aggregated Problem Is Expanded To That Of The Original Problem
  • Computational Results Show That The Aggregation Procedure And The Decomposition Strategy Are Very Ef
  • And Our Solutions Are Superior To The Industrial Solutions Given The Constraints Considered In This
  • The World'S Second Largest Producer Of Pork
  • Danish Crown
  • Also Provides A Fresh Meat Supply Logistics System Within Denmark
  • This Is Used By The Majority Of Supermarkets In Denmark
  • This Article Addresses An Integrated Vehicle Routing And Driver Scheduling Problem Arising At Danish
  • The Problem Consists Of A 1‐Week Planning Horizon
  • And Drivers With Predefined Work Regulations
  • And A Break Rule
  • The Objective Is To Minimize The Total Delivery Cost That Is A Weighted Sum Of Two Kinds Of Delivery
  • A Multilevel Variable Neighborhood Search Heuristic Is Proposed For The Problem
  • In A Preprocessing Step
  • The Method Is Implemented And Tested On Real‐Life Data Consisting Of Up To 2
  • 000 Orders Per Week

Abstract

There are no comments yet on this publication. Be the first to share your thoughts.

Statistics

Seen <100 times
0 Comments