NDLI: An Improved Branch and Bound Algorithm for Location-Routing Problems

Content Provider	IEEE Xplore Digital Library
Author	Jin Li Zhu Yunlong Shen Hai
Copyright Year	2009
Abstract	An important limitation of the fixed charge location model, is the assumption that full truckload quantities are shipped from a facility to a customer. In many contexts, shipments are made in less-than-truckload (LTL) quantities from a facility to customers along a multiple-stop route. The different location decision is made from the different cost of delivery. In this paper we are concerned with a particular type of facility location problem in which there exist two echelons of facilities. To make the location decision, the delivery cost of a multiple-stop route are calculated. We note that this is an NP-hard problem and use a Lagrangian relaxation-based branch and bound algorithm to solve this location-routing problem. We present numerical results for various size test problems. Results indicates the method is efficient.
Starting Page	58
Ending Page	63
File Size	319854
Page Count	6
File Format	PDF
ISBN	9780769539300
e-ISBN	9781424454235
DOI	10.1109/IFCSTA.2009.21
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2009-12-25
Publisher Place	China
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Constraint optimization Costs NP-hard problem Computer applications Routing Computer networks Mathematical model Application software Lagrangian functions Vehicles
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

An efficient multicast routing algorithm for delay-sensitive applications with dynamic membership

A Branch and Cut method for the Capacitated Location-Routing Problem

An exact algorithm for the network synthesis problem

A two-phase algorithm for the star-star concentrator location problem

Genetic Algorithm in Vehicle Routing Problem

A two ant colony approaches for the multi-depot capacitated arc routing problem

Novel VNS Algorithms on Asymmetric Traveling Salesman Problems

Solving capacitated vehicle routing problem using intelligent water drops algorithm

A simple multi-objective optimization algorithm for the urban transit routing problem

An Improved Branch and Bound Algorithm for Location-Routing Problems

Similar Documents

An efficient multicast routing algorithm for delay-sensitive applications with dynamic membership

A Branch and Cut method for the Capacitated Location-Routing Problem

An exact algorithm for the network synthesis problem

A two-phase algorithm for the star-star concentrator location problem

Genetic Algorithm in Vehicle Routing Problem

A two ant colony approaches for the multi-depot capacitated arc routing problem

Novel VNS Algorithms on Asymmetric Traveling Salesman Problems

Solving capacitated vehicle routing problem using intelligent water drops algorithm

A simple multi-objective optimization algorithm for the urban transit routing problem

An Improved Branch and Bound Algorithm for Location-Routing Problems