[Coin-discuss] VRP Question - Newbie

[Harder, Robert, 1Lt, AFPOA/DPYC]

Walker, ah, I'm glad you found the coin list. You'll find smarter people
than I here.

For the LP-oriented folks on the coin list: other than the subtour-breaking
constraints, I imagine this problem would not have too terrible a
formulation, right? Of course, I'm partial to tabu searches. =)

I forgot to ask you before, Walker, are you more comfortable with linear
programming/mixed integer programming? Maybe you could solve this in Excel
(no offense to OSL/CPLEX users).

-Robert

 
 +-------------------------------------+
 | Robert Harder, 1Lt, USAF, AFPOA/DPY |
 | Civilian Personnel Policy Analyst   |
 | (703) 604-1341  DSN: 664-1341       |
 | robert.harder at pentagon.af.mil       |
 +-------------------------------------+ 
 


-----Original Message-----
From: Walker White [mailto:Walker.White at oracle.com]
Sent: Friday, June 29, 2001 11:05 PM
To: coin-discuss at oss.software.ibm.com
Subject: [Coin-discuss] VRP Question - Newbie


I have the following problem which I believe can be solved by VRP
software like OpenTS:

5 trucks
1 depot (capacity is irrelevant, service calls only, no pickup/dropoff)
25-35 service calls/day (4-6 calls/truck)
no service window requirements (yet)

Questions:
1. Is this a VRP problem?
	1.1. Will OpenTS solve a problem like this?
	1.2. Can anyone point me to an example?
2. If not, do open source solutions for this problem exist? 

Thanks for your help for this newbie.  Please respond directly, as I am
not on coin-discuss.

Walker White