This paper was published through Galoá and has a deposited DOI. To cite this paper, use one of the standards below:
In case you are one of the co-authors and want to register this paper in your Lattes, use the following code: doi > 10.59254/sbpo-2019-106695
If you've NEVER registered a DOI in your Lattes, check our tutorial!In this article, the Heterogeneous Vehicle Routing Problem with Multiple Deliverymen and Simultaneous Pickup and Delivery (HVRPMDSPD) is discussed. This problem is inspired by real world reverse logistics applications where a bottling company, using a fleet of different vehicles, must deliver beverages to clients and also pick up empty cases of bottles to recycle. Moreover, it is usually not possible to stop at every client’s location, and many clients might be close to one another. This proximity allows the vehicles to park at certain areas from where the deliverymen can serve the clients nearby on foot. Employing more deliverymen on a given route cuts down service times, but also potentially raises operational costs. The HVRPMDSPD is modelled mathematically as a Mixed Integer Linear Programming Model (MILP) problem. A constructive heuristic was developed so as to provide an initial solution for the solver CPLEX, and the solutions obtained were investigated.
With nearly 200,000 papers published, Galoá empowers scholars to share and discover cutting-edge research through our streamlined and accessible academic publishing platform.
Learn more about our products:
This proceedings is identified by a DOI , for use in citations or bibliographic references. Attention: this is not a DOI for the paper and as such cannot be used in Lattes to identify a particular work.
Check the link "How to cite" in the paper's page, to see how to properly cite the paper