Showing 1 - 10 of 1,519
Persistent link: https://www.econbiz.de/10000861305
This paper addresses the towing process of airplanes as part of the turnaround process. We introduce a VRP based MIP model which assigns different types of towing tractors to jobs with specified service time windows. The objective function minimizes operating costs subject to operational...
Persistent link: https://www.econbiz.de/10010931059
We present node-arc and arc-path formulations, and develop a branch-and-price approach for the directed network design problem with relays (DNDR). The DNDR problem can be used to model many network design problems in transportation, service, and telecommunication system, where relay points are...
Persistent link: https://www.econbiz.de/10010870971
Redistricting, the redrawing of congressional district boundaries within the states, may occur every 10 years on the basis of the population census. Many redistricting plans are designed with partisan politics in mind, resulting in disputes and forcing judges to intervene. We address this...
Persistent link: https://www.econbiz.de/10009204059
mathematical programming formulations for the problem. A branch-and-price algorithm is also proposed to solve a set partitioning …
Persistent link: https://www.econbiz.de/10010744226
-and-Price algorithm to solve it. The pricing problems have a very complex nature. We discuss a dynamic programming algorithm to solve them …
Persistent link: https://www.econbiz.de/10008570622
-and-Price algorithm to solve it. The pricing problems have a very complex nature. We discuss a dynamic programming algorithm to solve them …
Persistent link: https://www.econbiz.de/10011149242
The sales force deployment problem arises in many selling organizations. This complex planning problem involves the concurrent resolution of four interrelated subproblems: sizing of the sales force, sales representatives locations, sales territory alignment, and sales resource allocation. The...
Persistent link: https://www.econbiz.de/10011097827
We study a vehicle routing problem with soft time windows and stochastic travel times. In this problem, we consider stochastic travel times to obtain routes which are both efficient and reliable. In our problem setting, soft time windows allow early and late servicing at customers by incurring...
Persistent link: https://www.econbiz.de/10011097851
Persistent link: https://www.econbiz.de/10004652706