Research
Interests
My general research interests lie in the field of combinatorial optimization. This fascinating field exists at the intersection of artificial intelligence, theoretical computer science, and operations research, to name a few. My specific areas of interest include stochastic optimization, online optimization, local search, and constraint programming. A unifying theme for my research is the development of methods for incorporating stochastic information about the future into difficult online optimization problems, such as vehicle routing, packet scheduling, facility location, and airline crew scheduling, in addition to developing scalable search tools for solving large combinatorial problems. More recently I have become interested in the myriad of combinatorial problems that occur in modeling and solving infrastructure networks.
Publications
Many of the papers posted below are the technical report pre-prints.
Please consult the actual publication for the final version.
Books
[1] P. Van Hentenryck and R.Bent. Online Stochastic Combinatorial Optimization.
MIT
Press, 2006.
Journal Publications
[6]
P. Van Hentenryck, R. Bent, L. Mercier, and Y. Vergados. Online Stochastic Reservation Systems. Annals
of Operations Research (to appear). (pdf)
[5] R. Bent and P. Van Hentenryck. A
Two-Stage Hybrid Algorithm for Pickup and Delivery Vehicle Routing Problems
with Time Windows. Computers
and Operations Research, Volume 33 (4): 875-893, 2006. Preliminary
version appears in CP 2003. (CP 2003 ps version) © Springer Verlag
[4] R. Bent and P. Van Hentenryck. A Two-Stage Hybrid Local Search for
the Vehicle Routing Problem with Time Windows, Transportation Science, Volume 38
(4): 515-530, 2004. (ps pre-print) (pdf
pre-print)
[3] R. Bent and P. Van Hentenryck.
Scenario-Based Planning for Partially Dynamic Vehicle Routing with Stochastic
Customers. Operations Research,
Volume 52 (6), 977-987, 2004. (pdf pre-print) (ps pre-print). The benchmarks can be found here.
[2] A. Anagnostopoulos, R. Bent, E. Upfal,
and P. Van Hentenryck. A Simple and Deterministic Competitive Algorithm for
Online Facility Location. Information
and Computation, Volume 194 (2): 175-202, 2004. (ps
pre-print)
[1] R. Bent, M. Schear, L. Hemaspaandra, and
G. Istrate. A Note on Bounded-Weight Error-Correcting Codes, Journal of Universal Computer Science. Volume
5 (12): 817-827, 1999. (download)
Conference
Publications
[11] R. Bent and P. Van
Hentenryck. Randomized Adaptive Spatial
Decoupling for Large-Scale Vehicle Routing with Time Windows. Proceedings
of the Twenty-Second Conference on Artificial Intelligence (AAAI 2007), 173-178,
July 2007, Vancouver, BC. (pdf).
[10] R. Bent and P. Van
Hentenryck. Waiting and Relocation
Strategies in Online Stochastic Vehicle Routing. Proceedings of the
Twentieth International Joint Conference on Artificial Intelligence. (IJCAI 2007), 1816-1821, January 2007, Hyderabad, India. (pdf)
[9] P. Van Hentenryck, R. Bent,
and Y. Vergados. Online Stochastic
Reservation Systems. Proceedings of the Third International Conference of
AI and OR Techniques in Constraint Programming for Combinatorial Optimization
Problems. (CP-AI-OR 2006),
212-227, May 2006, Cork, Ireland. (pdf)
[8] R. Bent,
[7] R. Bent and P. Van Hentenryck. Online
Stochastic Optimization Without Distributions. Proceedings of the Fifteenth
International Conference on Automated Planning and Scheduling (ICAPS-2005), 171-180, June
2005,
[6] R. Bent and P. Van Hentenryck. Online
Stochastic and Robust Optimization, Proceedings of the Ninth Asian
Computing Science Conference (ASIAN-2004),
286-300, December 2004, Chiang Mai
[5] R. Bent and P. Van Hentenryck. Regrets
Only! Online Stochastic Optimization Under Time Constraints, Proceedings of
the Nineteenth National Conference on Artificial Intelligence (AAAI-2004),
501-506, July 2004,
[4] R. Bent and P. Van Hentenryck. The Value of Consensus in
Online Stochastic Scheduling, Proceedings of the Fourteenth International
Conference on Automated Planning and Scheduling (ICAPS-2004), 219-226, June
2004, Whistler, Canada (pdf)
[3] R. Bent and P. Van Hentenryck. A Two-Stage Hybrid
Algorithm for Pickup and Delivery Vehicle Routing Problems with Time Windows. Proceedings
of the Ninth International Conference on Constraint Programming (CP-2003) 123-137, September 2003,
[2] R. Bent and P. Van Hentenryck.
Dynamic Vehicle Routing with Stochastic Requests. Proceedings of the
Eighteenth International Joint Conference on Artificial Intelligence (IJCAI-2003) 1362-1363,
August 2003,
[1] A. Frank, G. Delamarter, R. Bent and B.
Hill. Astroflow: Engaging Simulations in a Planetarium. 195th Meeting
of the American Astronomical Society, January 2000,
Tutorials
[1] CP'04, Toronto, 2004 Online
Stochastic Optimization under Time Constraints. (with Pascal Van
Hentenryck)
Technical Reports
[2] R. Bent, P. Van Hentenryck, and
[1] R. Bent and P. Van Hentenryck. Dynamic Vehicle Routing with
Stochastic Requests. Technical Report, CS-03-10, Department of Computer
Science,
My DLBP entry can be found here
Education
Experience
Research and Teaching Assistant,
Software Developer and Researcher,
Software Developer, Syntelic Solutions Corporation, Gaithersburg, MD, 1997-2000
(at various disjoint points of time).
Email Contact: "rbent" followed by the "at" symbol followed
by "lanl.gov"
|
Operated by Los
Alamos National Security, LLC for the U.S.
Department of Energy's NNSA Outside | © Copyright 2006 Los
Alamos National Security, LLC All rights reserved | Disclaimer/Privacy
| Weblogin Contact Last Modified: 14 May 2008 |