12 search results - page 2 / 3 » Customer Selection and Profit Maximization in Vehicle Routin... |
CP
1998
Springer
13 years 12 months ago
1998
Springer
We use a local search method we term Large Neighbourhood Search (LNS) for solving vehicle routing problems. LNS meshes well with constraint programming technology and is analogous...
GECCO
2009
Springer
14 years 6 days ago
2009
Springer
The Vehicle Routing Problem’s main objective is to find the lowest-cost set of routes to deliver goods to customers, which have a service time window, using a fleet of identic...
TRANSCI
2010
13 years 2 months ago
2010
We consider the Courier Delivery Problem, a variant of the Vehicle Routing Problem with time windows in which customers appear probabilistically and their service times are uncert...
IOR
2010
13 years 4 months ago
2010
The paper considers a stylized model of a dynamic assortment optimization problem, where given a limited capacity constraint, we must decide the assortment of products to offer to...
WSC
1997
13 years 9 months ago
1997
For many companies the scheduling of job shops proves very difficult. Competing priorities (due dates, potential profit) from multiple customers confronts the plant manager with m...