default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPhilip Kilby
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i9]Saman Ahmadi, Guido Tack, Daniel Harabor, Philip Kilby, Mahdi Jalili:
Real-Time Energy-Optimal Path Planning for Electric Vehicles. CoRR abs/2411.12964 (2024)- 2023
- [j15]Arthur Mahéo
, Diego Gabriel Rossit, Philip Kilby:
Solving the integrated bin allocation and collection routing problem for municipal solid waste: a Benders decomposition approach. Ann. Oper. Res. 322(1): 441-465 (2023) - 2022
- [j14]Simon O. Obute, Philip Kilby, Mehmet Remzi Dogar, Jordan H. Boyle:
Swarm Foraging Under Communication and Vision Uncertainties. IEEE Trans Autom. Sci. Eng. 19(3): 1446-1457 (2022) - [c27]Martin Aleksandrov, Philip Kilby:
Efficiency and Truthfulness in Dial-a-Ride Problems with Customers Location Preferences. AI 2022: 690-703 - [c26]Saman Ahmadi, Guido Tack, Daniel Harabor, Philip Kilby:
Weight Constrained Path Finding with Bidirectional A. SOCS 2022: 2-10 - [i8]Saman Ahmadi, Guido Tack, Daniel Harabor, Philip Kilby:
Enhanced Methods for the Weight Constrained Shortest Path Problem: Constrained Path Finding Meets Bi-objective Search. CoRR abs/2207.14744 (2022) - 2021
- [c25]Saman Ahmadi, Guido Tack, Daniel Damir Harabor, Philip Kilby:
A Fast Exact Algorithm for the Resource Constrained Shortest Path Problem. AAAI 2021: 12217-12224 - [c24]Saman Ahmadi, Guido Tack, Daniel Harabor, Philip Kilby:
Vehicle Dynamics in Pickup-And-Delivery Problems Using Electric Vehicles. CP 2021: 11:1-11:17 - [c23]Saman Ahmadi, Guido Tack, Daniel Harabor, Philip Kilby:
Bi-Objective Search with Bi-Directional A. ESA 2021: 3:1-3:15 - [c22]Saman Ahmadi, Guido Tack, Daniel Harabor, Philip Kilby:
Bi-Objective Search with Bi-directional A* (Extended Abstract). SOCS 2021: 142-144 - [i7]Saman Ahmadi, Guido Tack, Daniel Harabor, Philip Kilby:
Bi-objective Search with Bi-directional A. CoRR abs/2105.11888 (2021) - 2020
- [j13]Dan C. Popescu, Philip Kilby:
Approximation of the Shapley value for the Euclidean travelling salesman game. Ann. Oper. Res. 289(2): 341-362 (2020) - [j12]Francesco Bertoli, Philip Kilby, Tommaso Urli:
A column-generation-based approach to fleet design problems mixing owned and hired vehicles. Int. Trans. Oper. Res. 27(2): 899-923 (2020) - [j11]Edward Lam, Pascal Van Hentenryck, Philip Kilby:
Joint Vehicle and Crew Routing and Scheduling. Transp. Sci. 54(2): 488-511 (2020) - [c21]Simon O. Obute, Philip Kilby, Mehmet Remzi Dogar, Jordan H. Boyle:
RepAtt: Achieving Swarm Coordination through Chemotaxis. CASE 2020: 1307-1312 - [c20]Arthur Mahéo, Diego Gabriel Rossit, Philip Kilby:
A Benders Decomposition Approach for an Integrated Bin Allocation and Vehicle Routing Problem in Municipal Waste Management. ICPR-Americas (2) 2020: 3-18 - [i6]Haoning Xi, Wei Liu, David Rey, S. Travis Waller, Philip Kilby:
Incentive-compatible mechanisms for continuous resource allocation in mobility-as-a-service: Pay-as-You-Go and Pay-as-a-Package. CoRR abs/2009.06806 (2020)
2010 – 2019
- 2019
- [j10]Arthur Mahéo, Philip Kilby, Pascal Van Hentenryck:
Benders Decomposition for the Design of a Hub and Shuttle Public Transit System. Transp. Sci. 53(1): 77-88 (2019) - 2017
- [c19]Tommaso Urli, Philip Kilby:
Constraint-Based Fleet Design Optimisation for Multi-compartment Split-Delivery Rich Vehicle Routing. CP 2017: 414-430 - [c18]Mark Lawrenson, Tommaso Urli, Philip Kilby:
A model-based genetic algorithm framework for constrained optimisation problems. GECCO (Companion) 2017: 111-112 - 2016
- [j9]Philip Kilby, Tommaso Urli:
Fleet design optimisation from historical data using constraint programming and large neighbourhood search. Constraints An Int. J. 21(1): 2-21 (2016) - [j8]Haris Aziz, Casey Cahan, Charles Gretton, Philip Kilby, Nicholas Mattei, Toby Walsh:
A Study of Proxies for Shapley Allocations of Transport Costs. J. Artif. Intell. Res. 56: 573-611 (2016) - [c17]Tommaso Urli, Jana Brotánková, Philip Kilby, Pascal Van Hentenryck:
Intelligent Habitat Restoration Under Uncertainty. AAAI 2016: 3908-3914 - [c16]Jana Brotánková, Tommaso Urli, Philip Kilby:
Planning Habitat Restoration with Genetic Algorithms. GECCO 2016: 861-868 - [c15]Philip Kilby, Tommaso Urli:
Fleet Design Optimisation from Historical Data Using Constraint Programming and Large Neighbourhood Search. IJCAI 2016: 4185-4189 - [i5]Arthur Mahéo, Philip Kilby, Pascal Van Hentenryck:
Benders Decomposition for the Design of a Hub and Shuttle Public Transit System. CoRR abs/1601.00367 (2016) - [i4]Arthur Mahéo, Tommaso Urli, Philip Kilby:
Fleet Size and Mix Split-Delivery Vehicle Routing. CoRR abs/1612.01691 (2016) - 2015
- [c14]Haris Aziz, Casey Cahan, Charles Gretton, Philip Kilby, Nicholas Scott Mattei, Toby Walsh:
A Study of Proxies for Shapley Allocations of Transport Costs. AAAI Workshop: AI for Transportation 2015 - [c13]Edward Lam, Pascal Van Hentenryck, Philip Kilby:
Joint Vehicle and Crew Routing and Scheduling. CP 2015: 654-670 - 2014
- [j7]Elena Kelareva, Kevin Tierney, Philip Kilby:
CP methods for scheduling and routing with time-dependent task costs. EURO J. Comput. Optim. 2(3): 147-194 (2014) - [c12]Dana Pordel, Lars Petersson, Philip Kilby:
dMap: A Low-Cost Distributed Mapping Concept for Future Road Asset Management. ICDSC 2014: 24:1-24:8 - [i3]Haris Aziz, Casey Cahan, Charles Gretton, Philip Kilby, Nicholas Mattei, Toby Walsh:
A Study of Proxies for Shapley Allocations of Transport Costs. CoRR abs/1408.4901 (2014) - 2013
- [c11]Elena Kelareva, Kevin Tierney, Philip Kilby:
CP Methods for Scheduling and Routing with Time-Dependent Task Costs. CPAIOR 2013: 111-127 - 2012
- [c10]Leonid Antsfeld, Daniel Damir Harabor, Philip Kilby, Toby Walsh:
TRANSIT Routing on Video Game Maps. AIIDE 2012 - [c9]Elena Kelareva, Sebastian Brand, Philip Kilby, Sylvie Thiébaux, Mark Wallace:
CP and MIP Methods for Ship Scheduling with Time-Varying Draft. ICAPS 2012 - 2011
- [c8]Ko-Hsin Cindy Wang, Adi Botea, Philip Kilby:
Solution Quality Improvements for Massively Multi-Agent Pathfinding. AAAI 2011: 1824-1825 - [c7]Daniel Damir Harabor, Adi Botea, Philip Kilby:
Path Symmetries in Undirected Uniform-Cost Grids. SARA 2011 - [c6]Ko-Hsin Cindy Wang, Adi Botea, Philip Kilby:
On Improving the Quality of Solutions in Large-Scale Cooperative Multi-Agent Pathfinding. SOCS 2011: 209-210 - [i2]Daniel Harabor, Philip Kilby:
Informed Heuristics for Guiding Stem-and-Cycle Ejection Chains. CoRR abs/1103.3904 (2011) - [i1]Daniel Harabor, Adi Botea, Philip Kilby:
Symmetry-Based Search Space Reduction For Grid Maps. CoRR abs/1106.4083 (2011) - 2010
- [j6]Andreas T. Ernst, Mark E. T. Horn, Philip Kilby, Mohan Krishnamoorthy:
Dynamic scheduling of recreational rental vehicles with revenue management extensions. J. Oper. Res. Soc. 61(7): 1133-1143 (2010)
2000 – 2009
- 2008
- [c5]Sven Koenig, Xiaoming Zheng, Craig A. Tovey, Richard B. Borie, Philip Kilby, Vangelis Markakis, Pinar Keskinocak:
Agent Coordination with Regret Clearing. AAAI 2008: 101-107 - 2007
- [j5]Andreas T. Ernst, Mark E. T. Horn, Mohan Krishnamoorthy, Philip Kilby, Phil Degenhardt, Michael Moran:
Static and Dynamic Order Scheduling for Recreational Rental Vehicles at Tourism Holdings Limited. Interfaces 37(4): 334-341 (2007) - [j4]Mark E. T. Horn, H. Jiang, Philip Kilby:
Scheduling patrol boats and crews for the Royal Australian Navy. J. Oper. Res. Soc. 58(10): 1284-1293 (2007) - 2006
- [c4]Philip Kilby, John K. Slaney, Sylvie Thiébaux, Toby Walsh:
Estimating Search Tree Size. AAAI 2006: 1014-1019 - [r1]Philip Kilby, Paul Shaw:
Vehicle Routing. Handbook of Constraint Programming 2006: 801-836 - 2005
- [c3]Philip Kilby, John K. Slaney, Sylvie Thiébaux, Toby Walsh:
Backbones and Backdoors in Satisfiability. AAAI 2005: 1368-1373 - [c2]Philip Kilby, John K. Slaney, Toby Walsh:
The Backbone of the Travelling Salesperson. IJCAI 2005: 175-180 - 2003
- [j3]Simon Dunstall, Mark E. T. Horn, Philip Kilby, Mohan Krishnamoorthy, Bowie Owens, David Sier, Sylvie Thiébaux:
An Automated Itinerary Planning System for Holiday Travel. J. Inf. Technol. Tour. 6(3): 195-210 (2003) - 2000
- [j2]Philip Kilby, Patrick Prosser, Paul Shaw:
A Comparison of Traditional and Constraint-based Heuristic Methods on Vehicle Routing Problems with Side Constraints. Constraints An Int. J. 5(4): 389-414 (2000) - [j1]Bruno De Backer, Vincent Furnon, Paul Shaw, Philip Kilby, Patrick Prosser:
Solving Vehicle Routing Problems Using Constraint Programming and Metaheuristics. J. Heuristics 6(4): 501-523 (2000) - [c1]John K. Slaney, Sylvie Thiébaux, Philip Kilby:
Estimating the Hardness of Optimisation. ECAI 2000: 123-130
Coauthor Index
aka: Daniel Damir Harabor
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 23:03 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
