Volume 23, Issue 4 (IJIEPR 2012)                   IJIEPR 2012, 23(4): 309-315 | Back to browse issues page

XML Print

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

Karimi H, Seifi A. Acceleration of Lagrangian Method for the Vehicle Routing Problem with Time Windows. IJIEPR 2012; 23 (4) :309-315
URL: http://ijiepr.iust.ac.ir/article-1-451-en.html
1- Amirkabir Uni.
2- Amirkabir Uni. , aseifi@aut.ac.ir
Abstract:   (6756 Views)
The analytic center cutting plane method (ACCPM) is one of successful methods to solve nondifferentiable optimization problems. In this paper ACCPM is used for the first time in the vehicle routing problem with time windows (VRPTW) to accelerate lagrangian relaxation procedure for the problem. At first the basic cutting plane algorithm and its relationship with column generation method is clarified then the new method based on ACCPM is proposed as a stabilization technique of column generation (lagrangian relaxation). Both approaches are tested on a benchmark instance to demonstrate the advantages of proposed method in terms of computational time and lower bounds quality.
Full-Text [PDF 424 kb]   (3509 Downloads)    
Type of Study: Research | Subject: Operations Research
Received: 2012/07/2 | Accepted: 2014/07/21 | Published: 2014/07/21

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.