Abstract

We address a logistics districting problem faced by a parcel company whose operations consist of picking up and delivering packages over a service region. The districting process aims to find a partition of the service region into delivery and collection zones that may be served by a single vehicle that departs from a central depot. Criteria to be optimized are to balance workload content among the districts and to create districts of compact shape. A solution approach based on a hybrid procedure that combines elements of GRASP and Tabu Search (TS) is proposed to solve large-scale instances. Numerical experimentation is performed considering different instance sizes and types. Results show that the proposed solution approach is able to solve large-scale instances in reasonable computational times with good quality of the solutions obtained. To determine the quality of the solutions, results are compared with CPLEX solutions and with the current real solution to highlight the benefits of the proposed approach. Conclusions and recommendations for further research are provided.

Highlights

  • In this study, we consider a logistic districting problem faced by a parcel company that operates in the metropolitan area of Monterrey, Mexico

  • We address a logistics districting problem faced by a parcel company whose operations consist of picking up and delivering packages over a service region

  • We consider a logistic districting problem faced by a parcel company that operates in the metropolitan area of Monterrey, Mexico

Read more

Summary

Introduction

We consider a logistic districting problem faced by a parcel company that operates in the metropolitan area of Monterrey, Mexico. This company is concerned with the delivery and pickup of packages within Monterrey. The latter is divided into districts for logistic purposes. Each district is served by a single vehicle that departs from a central depot, in which the packages are received. At the end of the day, the vehicle comes back to the depot. It is assumed that the driver may receive new dispatch orders along the day

Objectives
Methods
Conclusion
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call