Pricing in Dynamic Vehicle Routing Problems

Published Online:https://doi.org/10.1287/trsc.1070.0193

References

  • Balas E. The prize collecting traveling salesman problem. Networks (1989) 19:621–636CrossrefGoogle Scholar
  • Bent R. W., Van Hentenryck P. Scenario-based planning for partially dynamic vehicle routing with stochastic customers. Oper. Res. (2004) 52:977–987LinkGoogle Scholar
  • Bertsimas D. J., Jaillet P., Odoni A. R. A priori optimization. Oper. Res. (1990) 38:1019–1033LinkGoogle Scholar
  • Branke J., Middendorf M., Noeth G., Dessouky M. Waiting’ strategies for dynamic vehicle routing. Transportation Sci. (2005) 39:298–312LinkGoogle Scholar
  • Caplice C. An optimization based bidding process: A new framework for shipper-carrier relationship. (1996) . Ph.D. thesis, School of Engineering, MIT, Cambridge, MAGoogle Scholar
  • Coyle J., Bardi E., Novac R.Transportation (2000) 5th ed.(South-Western College Publishing)Google Scholar
  • Dai Q. Z., Kauffman R. J. Business models for Internet-based B2B electronic markets. Internat. J. Electronic Commerce (2002) 6:41–72Google Scholar
  • Dantzig G. B., Ramser J. H. The truck dispatching problem. Management Sci. (1959) 6:80–91LinkGoogle Scholar
  • Dell’Amico M., Maffioli F., Värbrand P. On prize-collecting tours and the asymmetric travelling salesman problem. Internat. Trans. Oper. Res. (1995) 2:297–309CrossrefGoogle Scholar
  • Feillet D., Dejax P., Gendreau M. Traveling salesman problems with profits. Transportation Sci. (2005) 39:188–205LinkGoogle Scholar
  • Figliozzi M. Performance and analysis of spot truck-load procurement markets using sequential auctions. (2004) . Ph.D. thesis, School of Engineering, University of Maryland, College Park, MDGoogle Scholar
  • Figliozzi M., Mahmassani H., Jaillet P. Framework for study of carrier strategies in auction-based transportation marketplace. Transportation Res. Record (2003a) 1854:162–170CrossrefGoogle Scholar
  • Figliozzi M., Mahmassani H., Jaillet P. Modeling carrier behavior in sequential auction transportation markets. 10th Internat. Conf. Travel Behav. Res. (IATBR) (2003b) Lucerne, SwitzerlandGoogle Scholar
  • Figliozzi M., Mahmassani H., Jaillet P. Competitive performance assessment of dynamic vehicle routing technologies using sequential auctions. Transportation Res. Record (2004) 1882:10–18CrossrefGoogle Scholar
  • Figliozzi M., Mahmassani H., Jaillet P. Auction settings and performance of electronic marketplaces for truckload transportation services. Transportation Res. Record (2005) 1906:89–97CrossrefGoogle Scholar
  • Figliozzi M., Mahmassani H., Jaillet P. Quantifying opportunity costs in sequential transportation auctions for truckload acquisition. Transportation Res. Record (2006) 1964:247–252CrossrefGoogle Scholar
  • Gendreau M., Laporte G., Seguin R. Stochastic vehicle routing. Eur. J. Oper. Res. (1996) 88:3–12CrossrefGoogle Scholar
  • Godfrey G. A., Powell W. B. An adaptive dynamic programming algorithm for dynamic fleet management, I: Single period travel times. Transportation Sci. (2002) 36:21–39LinkGoogle Scholar
  • Golden B. L., Levy L., Vohra R. The orienteering problem. Naval Res. Logist. (1987) 34:307–318CrossrefGoogle Scholar
  • Hemert J. van, La Poutre J. A. Dynamic routing problems with fruitful regions: Models and evolutionary computation. Parallel Problem Solving from Nature VIII (2004) (Springer, New York) Google Scholar
  • Hvattum L., Lokketangen A., Laporte G. Solving a dynamic and stochastic vehicle routing problem with a sample scenario hedging heuristic. Transportation Sci. (2006) 40(4):421–438LinkGoogle Scholar
  • Ichoua S., Gendreau M., Potvin J. Y. Exploiting knowledge about future demands for real-time vehicle dispatching. Transportation Sci. (2006) 40:211–225LinkGoogle Scholar
  • Jaillet P. A priori solution of a traveling salesman problem in which a random subset of the customers are visited. Oper. Res. (1988) 36:929–936LinkGoogle Scholar
  • Jaillet P., Odoni A., Golden B., Assad A. Probabilistic vehicle routing problems in vehicle routing: Methods and studies. Studies in Management Science and Systems (1988) 16(North Holland, Amsterdam, The Netherlands) 293–318Google Scholar
  • Kleywegt A. J., Papastavrou J. D. Acceptance and dispatching policies for a distribution problem. Transportation Sci. (1998) 32:127–141LinkGoogle Scholar
  • Krishna V.Auction Theory (2002) (Academic Press, San Diego, CA) Google Scholar
  • Laporte G., Louveaux F. V. The integer L-shaped method for stochastic integer programs with complete recourse. Oper. Res. Lett. (1993) 13:133–142CrossrefGoogle Scholar
  • Laporte G., Louveaux F., Mercure H. The vehicle-routing problem with stochastic travel-times. Transportation Sci. (1992) 26:161–170LinkGoogle Scholar
  • Mitrovic-Minic S., Laporte G. Waiting strategies for the dynamic pickup and delivery problem with time windows. Transportation Res. Part B (2004) 38:635–655CrossrefGoogle Scholar
  • Mitrovic-Minic S., Krishnamurti R., Laporte G. Double-horizon based heuristics for the dynamic pickup and delivery problem with time windows. Transportation Res. Part B (2004) 38:669–685CrossrefGoogle Scholar
  • Nandiraju S., Regan A. Freight transportation electronic marketplaces: A survey of market clearing mechanisms and exploration of important research issues. Proc. 84th Annual Meeting Transportation Res. Board (2005) Washington, D.C.(JanuaryGoogle Scholar
  • Powell W. B. A stochastic-model of the dynamic vehicle allocation problem. Transportation Sci. (1986) 20:117–129LinkGoogle Scholar
  • Powell W. An operational planning model for the dynamic vehicle allocation problem with uncertain demands. Transportation Res. Part B (1987) 21B(3):217–232CrossrefGoogle Scholar
  • Powell W. B. A stochastic formulation of the dynamic assignment problem, with an application to truckload motor carriers. Transportation Sci. (1996) 30:195–219LinkGoogle Scholar
  • Powell W., Jaillet P., Odoni A., Ball M. O., Magnanti T. L., Monma C. L., Nemhauser G. L. Stochastic and dynamic networks and routing. Handbook in Operations Research and Management Science, Vol. 8, Network Routing (1995) (Elsevier, Amsterdam, The Netherlands) 141–296Google Scholar
  • Powell W., Towns M., Marar A. On the value of optimal myopic solution for dynamic routing and scheduling problems in the presence of user noncompliance. Transportation Sci. (2000) 34(1):50–66LinkGoogle Scholar
  • Sheffi Y. Combinatorial auctions in the procurement of transportation services. Interfaces (2004) 34:245–252LinkGoogle Scholar
  • Solomon M. M., Desrosiers J. Time window constrained routing and scheduling problems. Transportation Sci. (1988) 22:1–13LinkGoogle Scholar
  • Song J., Regan A. Approximation algorithms for the bid construction problem in combinatorial auctions for the procurement of freight transportation contracts. Transportation Res. Part B (2005) 39:914CrossrefGoogle Scholar
  • Stewart W. R., Golden B. L. Stochastic vehicle-routing—A comprehensive approach. Eur. J. Oper. Res. (1983) 14:371–385CrossrefGoogle Scholar
  • TCA (2003) . Truckload Carrier Association Website. http://www.truckload.org/infocenter/TCAdocs/info_08_02_02.htmGoogle Scholar
  • Thomas B. W., White C. C. Anticipatory route selection. Transportation Sci. (2004) 38:473–487LinkGoogle Scholar
  • Tirole J.The Theory of Industrial Organization (1989) (MIT Press, Cambridge, MA) Google Scholar
  • Topaloglu H., Powell W. Dynamic programming approximations for stochastic, time-staged integer multicommodity flow problems. (2002) . Technical Report CL-00-02, Department of Operations Research and Financial Engineering, Princeton University, Princeton, NJGoogle Scholar
  • Topaloglu H., Powell W. B. An algorithm for approximating piecewise linear concave functions from sample gradients. Oper. Res. Lett. (2003) 31:66–76CrossrefGoogle Scholar
  • Toth P., Vigo D.The Vehicle Routing Problem (2002) (Society for Industrial and Applied Mathematics, Philadelphia, PA) CrossrefGoogle Scholar
  • Vickrey W. Counterspeculation, auctions and competitive sealed tenders. J. Finance (1961) 16:8–37CrossrefGoogle Scholar
  • Wang X. B., Xia M. Combinatorial bid generation problem for transportation service procurement. Network Modeling 2005 (2005) (Transportation Research Board Natl Research Council, Washington, D.C.) Google Scholar
  • Yang J., Jaillet P., Mahmassani H. Real-time multivehicle truckload pickup and delivery problems. Transportation Sci. (2004) 38:135–148LinkGoogle Scholar
  • Zhu K. Information transparency of business-to-business electronic markets: A game-theoretic analysis. Management Sci. (2004) 50:670–685LinkGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.