Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

Model by hand and OPL 4. Given the following distance matrix. Assume that row 1 represents the home base of a vehicle routing problem. Each

Model by hand and OPL image text in transcribed
4. Given the following distance matrix. Assume that row 1 represents the home base of a vehicle routing problem. Each customer needs to be visited exactly one time and you want to minimize the total distance traveled Model this problem as an IP, solve it in OPL and report the solution (use a script file) A. Do this if you have 6 vehicles and each vehicle must visit exactly two customers B. Try to do this for 3 vehicles where each vehicle must visit at least two customers [[0,2457,712,1433,66,2141,1616,635,2407,1104,644,1167,1057], 2457,0,1752,1374,2409,365,851,1853,958,2339,1817,1688,1775], [712,1752,0,954,672,1452,906,275,1737,1195,167,838,778], 1433,1374,954,0.1368,1010,871,829,1891,967,878,336,445], 66,2409,672,1368,0,2090,1572,577,2383,1047,593,1101,991], 2141,365,1452,1010,2090,0,593,1522,1,1974,1498,1324,1412], 1616,851,906,871,1572,593,0,1039,1033,1710,987,1078,1124], 635,1853,275,829,577,1522,1039,0,1956,920,108,633,550], 2407,958,1737,1891,2383,1111,1033,1956,0,2732,1874,2110,2151], 1104,2339,1195,967,1047,1974,1710,920,2732,0,1028,654,587], [644,1817,167,878,593,1498,987,108,1874,1028,0,713,640], 1167,1688,838,336,101,1324,1078,633,2110,654,713,0,117, 1057,1775,778,445,991,1412,1124,550 2151 587 640,117,0] 4. Given the following distance matrix. Assume that row 1 represents the home base of a vehicle routing problem. Each customer needs to be visited exactly one time and you want to minimize the total distance traveled Model this problem as an IP, solve it in OPL and report the solution (use a script file) A. Do this if you have 6 vehicles and each vehicle must visit exactly two customers B. Try to do this for 3 vehicles where each vehicle must visit at least two customers [[0,2457,712,1433,66,2141,1616,635,2407,1104,644,1167,1057], 2457,0,1752,1374,2409,365,851,1853,958,2339,1817,1688,1775], [712,1752,0,954,672,1452,906,275,1737,1195,167,838,778], 1433,1374,954,0.1368,1010,871,829,1891,967,878,336,445], 66,2409,672,1368,0,2090,1572,577,2383,1047,593,1101,991], 2141,365,1452,1010,2090,0,593,1522,1,1974,1498,1324,1412], 1616,851,906,871,1572,593,0,1039,1033,1710,987,1078,1124], 635,1853,275,829,577,1522,1039,0,1956,920,108,633,550], 2407,958,1737,1891,2383,1111,1033,1956,0,2732,1874,2110,2151], 1104,2339,1195,967,1047,1974,1710,920,2732,0,1028,654,587], [644,1817,167,878,593,1498,987,108,1874,1028,0,713,640], 1167,1688,838,336,101,1324,1078,633,2110,654,713,0,117, 1057,1775,778,445,991,1412,1124,550 2151 587 640,117,0]

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Distributed Relational Database Architecture Connectivity Guide

Authors: Teresa Hopper

4th Edition

0133983064, 978-0133983067

More Books

Students also viewed these Databases questions

Question

1. Describe the factors that lead to productive conflict

Answered: 1 week ago