14 views

Uploaded by Harsh Kumar

Routing

- Beamer Example
- RESULT SHEET
- Mina Maher Tawfik-Cv
- ADF Learning 4 - Create Employee page
- BPLec1
- Finalexam 2013 Sol
- t3
- 35712710-Idoc-Day-2
- Kpd 702 - Advanced Web Programming
- 3.4
- Iso 9000-2000 clause's and coverages
- Chap 01 1Computer System
- java1
- Code
- 9780538466523_IM_ch01
- CP 2011 - Phase Test 1 Ques
- Curriculum Vitae
- Steps to Debug APD Routine Code _ SAP Blogs
- Compro PT PAS Electronical and Electrical Contractor
- Course Memo

You are on page 1of 4

48

Problem Description

The vehicle routing problem is well known in the area of combinatorial optimization. The

main reason for such popularity is this problem has a number of applications. For example,

the problem of scheduling the delivery of products to a customer using a fleet of vehicles can

be modeled as a vehicle routing problem. This problem is a generalization of the traveling

salesman problem.

The vehicle routing problem states the following: Given: (a) a fleet of K capacitated vehicles

domiciled at a common depot, say node 1; (b) a set of customer sites j = 1,,n each with a

prescribed demand dj; and (c) the cost cij of traveling from location i to j; Find the set of

routes for delivering (picking up) the goods to customer sites at the minimum cost. We

assume that the fleet of vehicles is homogeneous and that each vehicle has a capacity of u

units. (Ahuja et al. (1993)).

The aim of this project is to build a decision support system that will enable companies to

identify a schedule for delivering products to customers by solving the vehicle routing

problem. Below we present an integer programming formulation of this problem. To learn

more about the vehicle routing problem, we refer the students to Ahuja et al. (1993).

The following notation is used:

A

cij

di

k

xij

yij

takes the value 1 if some vehicle travels from site i to site j.

The objective is to minimize the total cost of delivering the products to customers. The first

set of constraints shows that there is at most one vehicle traveling from site i to site j (for all

(i,j)A). The second and third sets of constraints show that each customer site is visited

exactly once. A vehicle will enter and leave a city exactly once. The fourth and fifth set of

constraints show that there will be exactly K vehicles leaving the depot and exactly K

vehicles entering the depot. The sixth set of constraints shows that vehicle capacity should

not be violated. The seventh set of constraints is the sub-tour elimination constraints. The

eighth set of constraints is the integrality constraints.

Case Study 48

K

min :

c x

k 1 ( i , j )A

k

ij ij

Subject to :

K

yij

(i, j ) A,

(1)

ij

i 1,..., n,

(2)

ij

j 1,..., n,

(3)

1j

(4)

(5)

k

ij

k 1

n

y

j 1

n

y

i 1

n

y

j 1

n

y

i 1

d x

i 2 j 1

y

iQ jQ

i1

k

i ij

ij

Q 1

k 1,..., K ,

(6)

Q {2,3,..., n}

(7 )

(i, j ) A, k 1,..., K .

(8)

Nearest Neighbor:

Let V* denote the set of customer sites that have not been visited yet by a vehicle.

1. Start at the depot (node 1) and construct a path consisting of nodes 1, i1, ,ij, 1 where

s V * is such that

u d i1 d i 2 ... d i j d s .

2. Repeat Step 1 until all the sites are visited.

The total number of paths constructed presents the total number of vehicles needed to

deliver the products to customers.

To learn more about the nearest neighbor heuristic as well as other heuristic solution

approaches for the traveling salesman problem, we refer the students to Chopra and Meindl

(2001).

Excel Spreadsheets

1.

Case Study 48

2.

Build a spreadsheet that presents the cost of traveling from customer site i to site j.

User Interface

1.

2.

Build a data entry form. The following are suggestions to help you design this form. In

this form include two option buttons. The option buttons enable the user to select

whether to read the data from a file or manually enter the data. Include a command

button that, when clicked on, performs these actions:

3.

a.

If the user chose to read the data from a file, a text box should appear where the

user types in the name of the file.

b.

If the user chose to enter the data manually, a text box appears where the user can

type in the total number of customer sites (n). Upon submission of this information,

two tables appear. The first table, with dimensions 1 by n, allows the user to enter

the data about demand in each customer site. The second table, with dimensions n

by n, enables the user to type in the cost of traveling from one site to the others.

Build a form that presents the following details about a related example. The user can

understand how the nearest neighbor algorithm works by using this form.

a.

b.

c.

d.

Present how the nearest neighbor algorithm was implemented to solve this

example.

e.

The optimal number of vehicles needed to deliver the products to customers and

the corresponding transportation costs.

f.

4.

Build a form that allows the user to solve the problem and perform a sensitivity analysis.

Give the user the option to select either the Excel solver or the nearest neighbor

algorithm to solve the problem. Give the user a number of options (problem parameters

to choose from) for the sensitivity analyses.

5.

Build a form to allow the user to access the reports described below. For this purpose

use option buttons.

Design a logo for this project. Insert this logo in the forms created above. Pick a background

color and a font color for the forms created. Include the following in the forms created: record

navigation command buttons, record operations command buttons, and form operations

command buttons as needed.

Reports

1. Give a graphical representation of the optimal solution (vehicle tours).

2. Give a graphical representation of the solution (vehicle tours) found using the nearest

neighbor approach.

3. Present the total transportation cost and the total number of vehicles used when the

following occurs:

K T

K T

k 1t 1

k 1t 1

Case Study 48

K T

k a.

1t 1 The problem is solved optimally using Excel.

Subject to :

b.

K

zkt 1

4.forPresent

analysis.

t 1,...,the

T , results from the(1sensitivity

)

k 1

xkt I k ,t 1 I kt d kt

xkt Pkt z kt

xkt , I kt 0

z kt {0,1}

( 2)

(3)

(5)

Reference

Ahuja, R.K., Magnanti, T.L., Orlin, J.B., Network Flows: Theory, Algorithms and

for k 1,..., K

; t 1,...,Hall,

T , 1993.

(4)

Applications.

Prentice

Chopra, S., Meindl, P., Supply Chain Management: Strategy, Planning, and Operation.

Prentice Hall, 2001.

- Beamer ExampleUploaded bypanmerge
- RESULT SHEETUploaded byERSHAD AHAMED. C
- Mina Maher Tawfik-CvUploaded byMina Maher Tawfik
- ADF Learning 4 - Create Employee pageUploaded byVikram Kohli
- BPLec1Uploaded bym150
- Finalexam 2013 SolUploaded byYêu Thật Lòng
- t3Uploaded bykannasrk
- 35712710-Idoc-Day-2Uploaded byConstantine Kiriakopoulos
- Kpd 702 - Advanced Web ProgrammingUploaded byShakirinah Abdullah
- 3.4Uploaded byaarthisub
- Iso 9000-2000 clause's and coveragesUploaded byPrabhu Velidindi
- Chap 01 1Computer SystemUploaded byDarwin Vargas
- java1Uploaded byratan lal mourya
- CodeUploaded byKråñthï Kïråñ
- 9780538466523_IM_ch01Uploaded byKelly Brown
- CP 2011 - Phase Test 1 QuesUploaded byAbdul Hakim
- Curriculum VitaeUploaded bydjstunt
- Steps to Debug APD Routine Code _ SAP BlogsUploaded bymig007
- Compro PT PAS Electronical and Electrical ContractorUploaded bypanjiginanjar
- Course MemoUploaded byemzhin
- OutputUploaded byMohRozani
- midyearform2paper22010mathematics-100730000554-phpapp01Uploaded byThilagavathy Palaniappan
- tut segUploaded byVan Hieu
- programming spring 2020 syllabusUploaded byapi-235130528
- 5. SOA.pptxUploaded byAndrie Labenzhen
- BioinformaticsUploaded byISALE
- mind readUploaded byRupesh Pandey
- HOT SPOTUploaded bybhuvi2312
- CpaUploaded byendale egeta
- Solution 5.13Uploaded byirvannsur

- Steam_Excel.xlsUploaded byHarsh Kumar
- 06 Chapter 1Uploaded byHarsh Kumar
- OEC- Ellen MooreUploaded byHarsh Kumar
- Nukkad 15th AugustUploaded byHarsh Kumar
- CA PlantUploaded byHarsh Kumar
- NDLS-GZB Trains.pdfUploaded byHarsh Kumar
- FMS Delhi Placement Report 2015Uploaded byHarsh Kumar
- Gyan Capsule 1 - Introduction to ConsultingUploaded byHarsh Kumar
- HRSocUploaded byHarsh Kumar
- CRAP AssignmentUploaded byHarsh Kumar
- Internship ExperienceUploaded byHarsh Kumar
- Colloquim PPT - CopyUploaded byHarsh Kumar
- Puzzles to Puzzle YouUploaded byshahisk
- Ngo Work ReportUploaded byHarsh Kumar
- Chapter 5 July 2011Uploaded byHarsh Kumar
- MEL232 ForgingUploaded byHarsh Kumar

- SIAM Journal on Computing Volume 28 Issue 5 1999 [Doi 10.1137%2Fs0097539794274404] Talamo, Maurizio; Vocca, Paola -- An Efficient Data Structure for Lattice OperationsUploaded byanant_nimkar9243
- Indices, Surds and LogarithmUploaded byTutor World Online
- 2003 - Yang, Peng - Image Reconstruction Algorithms for Electrical Capacitance TomographyUploaded byBikashGupta
- LinAlgPaperFinal2 ScreenUploaded byArghya Roy Chaudhuri
- HonAlg2AnsKeyUploaded bypn11x2
- Introduction to MatlabUploaded byMijhael Anatholi Romero Mamani
- Student Solutions Manual for Introduction to Probability with Statistical ApplicationsUploaded bynimishtodi
- Gartside - Brunnian LinksUploaded byLeo
- L22Uploaded byAngad Sehdev
- sec3_mod2_logfun_te_041214.pdfUploaded byKenny Dang
- kuldeepUploaded byplasticjemanish
- Appl Math Lect NotesUploaded bywreathbearer
- Mathematics132Uploaded byandrewgoronga
- Chapter 6 diff eq smUploaded byfallenskylark
- Finite Difference Method for Hyperbolic ProblemsUploaded byozden
- Complex NumbersUploaded byYousuf Rahman
- Icns103 Midterm 1314t3Uploaded byNopporn SaSa
- 4037_w03_qp_1Uploaded byKhurram Ahmed
- Chapter 4 - Advanced Matrix OperationsUploaded byKrishna Kumar
- Mult Choice Review 2012 Harty Sem 1 1i2rf28Uploaded byMark Lester Brosas Torreon
- Hyperbolic Function.wikiPEDIAUploaded byAmiya Ranjan Malik
- Spivak Calculus of Manifolds SolutionsUploaded bycweeks2
- book-ch4.pdfUploaded byFrancisco Peñailillo Ortiz
- Homework 1 (2)Uploaded byHoang Trung Nguyen
- JUNE 2004 CAPE Pure Mathematics U1 P3BUploaded byVanoiMariaStylesWilkinson
- 3 LP Simplex MaximizationUploaded byYozi Ikhlasari Dahelza Arby
- fast fourier transform explaniedUploaded byprabinseth
- Module 4 - Integration 1 (self study)Uploaded byapi-3827096
- QueuesUploaded byVeda Vyas
- sec1-v2Uploaded byPiska Raghu