Browsing by Author "Laporte, G."
Now showing items 1-7 of 7
-
The attractive traveling salesman problem
Erdoğan, Güneş; Cordeau, J.-F.; Laporte, G. (Elsevier, 2010-05-16)In the Attractive Traveling Salesman Problem the vertex set is partitioned into facility vertices and customer vertices. A maximum profit tour must be constructed on a subset of the facility vertices. Profit is computed ... -
A branch-and-cut algorithm for solving the non-preemptive capacitated swapping problem
Erdoğan, Güneş; Cordeau, J.-F.; Laporte, G. (Elsevier, 2010-08-06)This paper models and solves a capacitated version of the Non-Preemptive Swapping Problem. This problem is defined on a complete digraph , at every vertex of which there may be one unit of supply of an item, one unit of ... -
Collaborative prepositioning network design for regional disaster response
Koyuncu, Burcu Balçık; Silvestri, S.; Rancourt, M.‐È.; Laporte, G. (Wiley, 2019-10)We present a collaborative prepositioning strategy to strengthen the disaster preparedness of the Caribbean countries, which are frequently hit by hurricanes. Since different subsets of countries are affected in each ... -
Designing new electoral districts for the city of Edmonton
Bozkaya, B.; Erkut, Erhan; Haight, D.; Laporte, G. (Informs, 2011-12-11)Every few years, the city of Edmonton, Canada must review and evaluate changes to its electoral district boundaries. The review process that was completed in 2009 resulted in modifying the district plan from a six-ward ... -
Metaheuristics for the traveling salesman problem with pickups, deliveries and handling costs
Erdoğan, Güneş; Battarra, M.; Laporte, G.; Vigo, D. (Elsevier, 2012-05)This paper studies the Traveling Salesman Problem with Pickups, Deliveries, and Handling Costs. The subproblem of minimizing the handling cost for a fixed route is analyzed in detail. It is solved by means of an exact ... -
Scheduling ambulance crews for maximum coverage
Erdoğan, Güneş; Erkut, Erhan; Ingolfsson, A.; Laporte, G. (Palgrave MacMillan, 2010-04)This paper addresses the problem of scheduling ambulance crews in order to maximize the coverage throughout a planning horizon. The problem includes the subproblem of locating ambulances to maximize expected coverage with ... -
The traveling salesman problem with pickups, deliveries, and handling costs
Battarra, M.; Erdoğan, Güneş; Laporte, G.; Vigo, D. (Informs, 2010-08)This paper introduces a new variant of the one-to-many-to-one single vehicle pickup and delivery problems (SVPDP) that incorporates the handling cost incurred when rearranging the load at the customer locations. The ...
Share this page
