liu.seSearch for publications in DiVA
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Coordinated Routing: applications in location and inventory management
Linköping University, Department of Science and Technology. Linköping University, The Institute of Technology.
2006 (English)Doctoral thesis, comprehensive summary (Other academic)
Abstract [en]

Almost everywhere, routing plays an important role in everyday life. This thesis consists of three parts, each studying different applications where routing decisions are coordinated with other decisions. A common denominator in all applications is that an intelligent utilization of a fleet of vehicles is crucial for the performance of the system. In the first part, routing and inventorymanagement decisions are coordinated, in the second part, routing decisions concerning different modes of transportation are coordinated with inventory management, and in the third part, location decision and routing are coordinated.

In the first part, an application concerning waste management is presented. Many industries generate garbage, and instead of handling the waste disposal themselves, other companies, specialized in garbage collection, handle the disposal. Each industry rents containers from a company to be used for waste, and the garbage collection companies handle the collection. The industries buy a service including one or more containers at the industry and the garbage collection companies are obliged to make sure that the containers never become overfull. The idea is that the industries buy this service and in return, the garbage collection company can plan the collection so that the overall cost and the number of overfull containers is minimized. Two models for the problem facing the garbage collection company are proposed. The first is solved using a Lagrangean relaxation approach on a flow based model, and the second is solved using Benders decomposition on a column based model.

The second part investigates a distribution chain management problem taken from the Swedish pulp industry. Given fixed production plans at the mills, and fixed customer demands, the problem is to minimize the distribution cost. Unlike many other models for marine distribution chains, the customers are not located at the harbors. This means that the model proposed also incorporates the distribution planning from the harbors to the customers. All customers are not served from the harbors; some are served directly from the mills using trucks and trains to distribute the pulp, and these decisions are also included. The problem is modeled as a mixed integer linear program and solved using a branch and price scheme. Due to the complexity of the problem, the solution strategy is divided into two phases, where the first emphasizes the generation of schedules for the vessels operated by the company, while the second deals with the chartering of vessels on the spot market.

In the third part, routing is combined with location decisions in the location-routing problem. Special emphasis is given to strategic management where decision makers must make location, capacity and routing decisions over a long planning period. The studied application comes fromstrategic schoolmanagement, where the location and capacity of the schools as well as their catchment areas are under consideration. The problem is modeled as a mixed integer linear program. The computational study shows the importance of incorporating

a routing component allowing multiple visits, as well as the danger of having a too short planning period.

Place, publisher, year, edition, pages
Institutionen för teknik och naturvetenskap , 2006.
Series
Linköping Studies in Science and Technology. Dissertations, ISSN 0345-7524 ; 999
Keyword [en]
Optimization, coordinated routing, inventory routing, ship routing, location, decision support, mathematical modeling
National Category
Computational Mathematics
Identifiers
URN: urn:nbn:se:liu:diva-7096ISBN: 91-85497-04-5 (print)OAI: oai:DiVA.org:liu-7096DiVA: diva2:22164
Public defence
2006-01-27, K3, Camus Norrköping, Linköpings universitet, Norrköping, 13:15 (English)
Opponent
Supervisors
Available from: 2006-07-12 Created: 2006-07-12 Last updated: 2009-02-12
List of papers
1. A Lagrangean Based Heuristic for the Inventory Routing Problem
Open this publication in new window or tab >>A Lagrangean Based Heuristic for the Inventory Routing Problem
2006 (English)In: European Journal of Operational Research, ISSN 0377-2217Article in journal (Refereed) Submitted
National Category
Engineering and Technology
Identifiers
urn:nbn:se:liu:diva-13900 (URN)
Available from: 2006-07-12 Created: 2006-07-12
2. A pseudo Benders Decomposition Approach
Open this publication in new window or tab >>A pseudo Benders Decomposition Approach
2002 (English)In: Proceedings of Nordic MPS ’02, 2002Conference paper, Published paper (Other academic)
National Category
Engineering and Technology
Identifiers
urn:nbn:se:liu:diva-13901 (URN)
Available from: 2006-07-12 Created: 2006-07-12
3. A Distribution Chain Management Problem in the Swedish Pulp Industry
Open this publication in new window or tab >>A Distribution Chain Management Problem in the Swedish Pulp Industry
2006 (English)Article in journal (Refereed) Submitted
National Category
Engineering and Technology
Identifiers
urn:nbn:se:liu:diva-13902 (URN)
Available from: 2006-07-12 Created: 2006-07-12
4. Decision Support for Distribution Chain Management: the Swedish Pulp Industry
Open this publication in new window or tab >>Decision Support for Distribution Chain Management: the Swedish Pulp Industry
2004 (English)In: 7th International Conference on Intelligent Transport Systems, 2004, 1051-1056 p.Conference paper, Published paper (Other academic)
National Category
Engineering and Technology
Identifiers
urn:nbn:se:liu:diva-13903 (URN)
Available from: 2006-07-12 Created: 2006-07-12 Last updated: 2009-04-23
5. Location-Routing Problems: An Annotated Bibliography
Open this publication in new window or tab >>Location-Routing Problems: An Annotated Bibliography
2006 (English)Article in journal (Refereed) Submitted
National Category
Engineering and Technology
Identifiers
urn:nbn:se:liu:diva-13904 (URN)
Available from: 2006-07-12 Created: 2006-07-12
6. The Relocation-Routing Problem
Open this publication in new window or tab >>The Relocation-Routing Problem
2006 (English)Article in journal (Refereed) Submitted
National Category
Engineering and Technology
Identifiers
urn:nbn:se:liu:diva-13905 (URN)
Available from: 2006-07-12 Created: 2006-07-12

Open Access in DiVA

fulltext(355 kB)2204 downloads
File information
File name FULLTEXT01.pdfFile size 355 kBChecksum MD5
c64a63fe577df04d0c316cd0a68e40709760430d58901487302d75477a3b79af61d9bb3a
Type fulltextMimetype application/pdf

Authority records BETA

Andersson, Henrik

Search in DiVA

By author/editor
Andersson, Henrik
By organisation
Department of Science and TechnologyThe Institute of Technology
Computational Mathematics

Search outside of DiVA

GoogleGoogle Scholar
Total: 2204 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

isbn
urn-nbn

Altmetric score

isbn
urn-nbn
Total: 2202 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf