Volume 14, Issue 1 (4-2017)                   2017, 14(1): 15-37 | Back to browse issues page

XML Persian Abstract Print

Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:

Dolatnejad A, Mirhassani S M, Yousefikhoshbakht M. A Mixed Integer Programming Formulation and an Effective Algorithm for Time Depended Petrol Station Replenishment Problem with Time Windows. Journal of Operational Research and Its Applications. 2017; 14 (1) :15-37
URL: http://jamlu.liau.ac.ir/article-1-1102-en.html
Department of Mathematics, Faculty of sciences, Bu-Ali Sina University, Hamedan
Abstract:   (3511 Views)

In order to improve service quality and satisfy specific delivery requests from different customers, suppliers are tending to afford more efficient and convenient distribution services rather traditional approaches. For example, customers may change preferred hours of receiving their orders, and due to this, wholesalers must distribute goods in different time windows. In this article, for the first time, the Time Depended Petrol Station Replenishment Problem with Time Windows (TDPSRPTW) is considered, and a new mathematical programming and a column generation method is proposed to solve it. This version of the PSRPTW is motivated by the fact that in some circumstances traffic conditions play an important role and cannot be ignored in order to perform a realistic optimization. The TDPSRPTW consists in optimally routing a limited heterogeneous fleet of vehicles of fixed capacity during a working day. It should be noticed that expense and time of the travel on the curve are dependent on the time that is spent on the curve, and delivery to a customer must be done based on time windows.  The aim here is to minimize the number of used vehicles and the total time spent, provided that travel times of goods be known at the beginning of the optimization. The algorithm has been tested in a set of instances including 15 stations in the literature, and it has been proven that the suggested algorithm is very efficient.

Full-Text [PDF 1018 kb]   (1136 Downloads)    
Type of Study: Applicable | Subject: Special
Received: 2016/09/12 | Accepted: 2017/01/28 | Published: 2017/06/13

Add your comments about this article : Your username or Email:

Send email to the article author

Rights and permissions
Creative Commons License This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.