Остановите войну!
for scientists:
default search action
Jean-Yves Potvin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j73]Hanane Krim, Nicolas Zufferey, Jean-Yves Potvin, Rachid Benmansour, David Duvivier:
Tabu search for a parallel-machine scheduling problem with periodic maintenance, job rejection and weighted sum of completion times. J. Sched. 25(1): 89-105 (2022) - 2021
- [j72]Ines Mathlouthi, Michel Gendreau, Jean-Yves Potvin:
A metaheuristic based on tabu search for solving a technician routing and scheduling problem. Comput. Oper. Res. 125: 105079 (2021) - [j71]Maha Gmira, Michel Gendreau, Andrea Lodi, Jean-Yves Potvin:
Tabu search for the time-dependent vehicle routing problem with time windows on a road network. Eur. J. Oper. Res. 288(1): 129-140 (2021) - [j70]Ines Mathlouthi, Michel Gendreau, Jean-Yves Potvin:
Branch-and-Price for a Multi-attribute Technician Routing and Scheduling Problem. Oper. Res. Forum 2(1) (2021) - 2020
- [j69]Maha Gmira, Michel Gendreau, Andrea Lodi, Jean-Yves Potvin:
Travel speed prediction based on learning methods for home delivery. EURO J. Transp. Logist. 9(4): 100006 (2020) - [j68]Jean-François Côté, Michel Gendreau, Jean-Yves Potvin:
The Vehicle Routing Problem with Stochastic Two-Dimensional Items. Transp. Sci. 54(2): 453-469 (2020)
2010 – 2019
- 2019
- [j67]Jean Respen, Nicolas Zufferey, Jean-Yves Potvin:
Impact of vehicle tracking on a routing problem with dynamic travel times. RAIRO Oper. Res. 53(2): 401-414 (2019) - 2018
- [j66]Hossein Hojabri, Michel Gendreau, Jean-Yves Potvin, Louis-Martin Rousseau:
Large neighborhood search with constraint programming for a vehicle routing problem with synchronization constraints. Comput. Oper. Res. 92: 87-97 (2018) - [j65]Simon Thevenin, Nicolas Zufferey, Jean-Yves Potvin:
Graph multi-coloring for a job scheduling application. Discret. Appl. Math. 234: 218-235 (2018) - [j64]Ines Mathlouthi, Michel Gendreau, Jean-Yves Potvin:
Mixed integer linear programming for a multi-attribute technician routing and scheduling problem. INFOR Inf. Syst. Oper. Res. 56(1): 33-49 (2018) - 2017
- [j63]Simon Thevenin, Nicolas Zufferey, Jean-Yves Potvin:
Makespan minimisation for a parallel machine scheduling problem with preemption and job incompatibility. Int. J. Prod. Res. 55(6): 1588-1606 (2017) - [j62]Florent Hernández, Michel Gendreau, Jean-Yves Potvin:
Heuristics for tactical time slot management: a periodic vehicle routing problem view. Int. Trans. Oper. Res. 24(6): 1233-1252 (2017) - [c7]Snezana Mitrovic Minie, Michel Gendreau, Jean-Yves Potvin, Jean Berger, Abdeslem Boukhtouta, Darren Thomson:
Military three-echelon disaster relief supply chain management. ICT-DM 2017: 1-8 - 2016
- [j61]Fernando Bernardes de Oliveira, Rasul Enayatifar, Hossein Javedani Sadaei, Frederico Gadelha Guimarães, Jean-Yves Potvin:
A cooperative coevolutionary algorithm for the Multi-Depot Vehicle Routing Problem. Expert Syst. Appl. 43: 117-130 (2016) - [j60]Fernando Bernardes de Oliveira, Rasul Enayatifar, Hossein Javedani Sadaei, Frederico Gadelha Guimarães, Jean-Yves Potvin:
Erratum to "A cooperative coevolutionary algorithm for the Multi-Depot Vehicle Routing Problem [Expert Systems with Applications 43 (2015) 117-130]". Expert Syst. Appl. 54: 398-402 (2016) - 2014
- [j59]Nabila Azi, Michel Gendreau, Jean-Yves Potvin:
An adaptive large neighborhood search for a vehicle routing problem with multiple routes. Comput. Oper. Res. 41: 167-173 (2014) - [j58]Jean-François Côté, Michel Gendreau, Jean-Yves Potvin:
An Exact Algorithm for the Two-Dimensional Orthogonal Packing Problem with Unloading Constraints. Oper. Res. 62(5): 1126-1141 (2014) - 2013
- [c6]Simon Thevenin, Nicolas Zufferey, Jean-Yves Potvin:
Tabu Search for a Preemptive Scheduling Problem with Job Incompatibilities. MIM 2013: 1590-1595 - 2012
- [j57]Nabila Azi, Michel Gendreau, Jean-Yves Potvin:
A dynamic vehicle routing problem with multiple delivery routes. Ann. Oper. Res. 199(1): 103-112 (2012) - [j56]Jean-François Côté, Michel Gendreau, Jean-Yves Potvin:
Large neighborhood search for the pickup and delivery traveling salesman problem with multiple stacks. Networks 60(1): 19-30 (2012) - [j55]Jean-François Côté, Claudia Archetti, Maria Grazia Speranza, Michel Gendreau, Jean-Yves Potvin:
A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks. Networks 60(4): 212-226 (2012) - 2011
- [j54]Sandro Lorini, Jean-Yves Potvin, Nicolas Zufferey:
Online vehicle routing and scheduling with dynamic travel times. Comput. Oper. Res. 38(7): 1086-1090 (2011) - [j53]Jean-Yves Potvin, Marc-André Naud:
Tabu search with ejection chains for the vehicle routing problem with private fleet and common carrier. J. Oper. Res. Soc. 62(2): 326-336 (2011) - 2010
- [j52]Mariam Tagmouti, Michel Gendreau, Jean-Yves Potvin:
A variable neighborhood descent heuristic for arc routing problems with time-dependent service costs. Comput. Ind. Eng. 59(4): 954-963 (2010) - [j51]Nabila Azi, Michel Gendreau, Jean-Yves Potvin:
An exact algorithm for a vehicle routing problem with time windows and multiple use of vehicles. Eur. J. Oper. Res. 202(3): 756-763 (2010)
2000 – 2009
- 2009
- [j50]Daniel De Ladurantaye, Michel Gendreau, Jean-Yves Potvin:
Optimizing profits from hydroelectricity production. Comput. Oper. Res. 36(2): 499-529 (2009) - [j49]Jean-François Bérubé, Michel Gendreau, Jean-Yves Potvin:
An exact epsilon-constraint method for bi-objective combinatorial optimization problems: Application to the Traveling Salesman Problem with Profits. Eur. J. Oper. Res. 194(1): 39-50 (2009) - [j48]Jean-François Côté, Jean-Yves Potvin:
A tabu search heuristic for the vehicle routing problem with private fleet and common carrier. Eur. J. Oper. Res. 198(2): 464-469 (2009) - [j47]Roxane Kouassi, Michel Gendreau, Jean-Yves Potvin, Patrick Soriano:
Heuristics for multi-period capacity expansion in local telecommunications networks. J. Heuristics 15(4): 381-402 (2009) - [j46]Jean-Yves Potvin:
State-of-the Art Review - Evolutionary Algorithms for Vehicle Routing. INFORMS J. Comput. 21(4): 518-548 (2009) - [j45]Jean-François Bérubé, Michel Gendreau, Jean-Yves Potvin:
A branch-and-cut algorithm for the undirected prize collecting traveling salesman problem. Networks 54(1): 56-67 (2009) - [p5]Jean-Yves Potvin:
A Review of Bio-inspired Algorithms for Vehicle Routing. Bio-inspired Algorithms for the Vehicle Routing Problem 2009: 1-34 - [r1]Jean-Yves Potvin:
Vehicle Routing. Encyclopedia of Optimization 2009: 4019-4022 - 2008
- [j44]Michel Gendreau, Jean-Yves Potvin:
Metaheuristics: A Canadian Perspective. INFOR Inf. Syst. Oper. Res. 46(1): 71-80 (2008) - 2007
- [j43]Nabila Azi, Michel Gendreau, Jean-Yves Potvin:
An exact algorithm for a single-vehicle routing problem with time windows and multiple routes. Eur. J. Oper. Res. 178(3): 755-766 (2007) - [j42]Mariam Tagmouti, Michel Gendreau, Jean-Yves Potvin:
Arc routing problems with time-dependent service costs. Eur. J. Oper. Res. 181(1): 30-39 (2007) - [j41]Daniel De Ladurantaye, Michel Gendreau, Jean-Yves Potvin:
Scheduling a hot rolling mill. J. Oper. Res. Soc. 58(3): 288-300 (2007) - [p4]Jean-François Cordeau, Gilbert Laporte, Jean-Yves Potvin, Martin W. P. Savelsbergh:
Chapter 7 Transportation on Demand. Transportation 2007: 429-466 - 2006
- [j40]Jean-Yves Potvin, Ying Xu, Ilham Benyahia:
Vehicle routing and scheduling with dynamic travel times. Comput. Oper. Res. 33: 1129-1137 (2006) - [j39]Jean-François Bérubé, Jean-Yves Potvin, Jean G. Vaucher:
Time-dependent shortest paths through a fixed sequence of nodes: application to a travel planning problem. Comput. Oper. Res. 33: 1838-1856 (2006) - [j38]Michel Gendreau, Jean-Yves Potvin, Ali Smires, Patrick Soriano:
Multi-period capacity expansion for a local access telecommunications network. Eur. J. Oper. Res. 172(3): 1051-1066 (2006) - [j37]Soumia Ichoua, Michel Gendreau, Jean-Yves Potvin:
Exploiting Knowledge About Future Demands for Real-Time Vehicle Dispatching. Transp. Sci. 40(2): 211-225 (2006) - [c5]Ilham Benyahia, Jean-Yves Potvin, Ying Xu:
A Complex Applications Framework Supporting Tolerant Dynamic Vehicle Dispatching. AICCSA 2006: 875-881 - 2005
- [j36]Michel Gendreau, Jean-Yves Potvin:
Metaheuristics in Combinatorial Optimization. Ann. Oper. Res. 140(1): 189-213 (2005) - 2004
- [j35]François-Xavier Le Louarn, Michel Gendreau, Jean-Yves Potvin:
GENI Ants for the Traveling Salesman Problem. Ann. Oper. Res. 131(1-4): 187-201 (2004) - [j34]Jean-Yves Potvin, Patrick Soriano, Maxime Vallée:
Generating trading rules on the stock markets with genetic programming. Comput. Oper. Res. 31(7): 1033-1047 (2004) - [j33]Michel Gendreau, Jean-Yves Potvin:
Issues in Real-Time Fleet Management. Transp. Sci. 38(4): 397-398 (2004) - 2003
- [j32]Bernard Gendron, Jean-Yves Potvin, Patrick Soriano:
A Tabu Search with Slope Scaling for the Multicommodity Capacitated Location Problem with Balancing Requirements. Ann. Oper. Res. 122(1-4): 193-217 (2003) - [j31]Soumia Ichoua, Michel Gendreau, Jean-Yves Potvin:
Vehicle dispatching with time-dependent travel times. Eur. J. Oper. Res. 144(2): 379-396 (2003) - [j30]Dale E. Blodgett, Michel Gendreau, François Guertin, Jean-Yves Potvin, René Séguin:
A Tabu Search Heuristic for Resource Management in Naval Warfare. J. Heuristics 9(2): 145-169 (2003) - [j29]Bernard Gendron, Jean-Yves Potvin, Patrick Soriano:
A parallel hybrid heuristic for the multicommodity capacitated location problem with balancing requirements. Parallel Comput. 29(5): 591-606 (2003) - [p3]Jean-Yves Potvin, Kate A. Smith:
Artificial Neural Networks for Combinatorial Optimization. Handbook of Metaheuristics 2003: 429-455 - 2002
- [j28]Bernard Gendron, Jean-Yves Potvin, Patrick Soriano:
Diversification strategies in local search for a nonbifurcated network loading problem. Eur. J. Oper. Res. 142(2): 231-241 (2002) - [j27]Jean-François Cordeau, Michel Gendreau, Gilbert Laporte, Jean-Yves Potvin, Frédéric Semet:
A guide to vehicle routing heuristics. J. Oper. Res. Soc. 53(5): 512-522 (2002) - [p2]Michel Gendreau, Gilbert Laporte, Jean-Yves Potvin:
Metaheuristics for the Capacitated VRP. The Vehicle Routing Problem 2002: 129-154 - 2001
- [j26]Éric D. Taillard, Luca Maria Gambardella, Michel Gendreau, Jean-Yves Potvin:
Adaptive memory programming: A unified view of metaheuristics. Eur. J. Oper. Res. 135(1): 1-16 (2001) - [c4]Ilham Benyahia, Jean-Yves Potvin:
Framework Architecture for Information Management in Dynamic Vehicle Dispatching. HICSS 2001 - 2000
- [j25]David Berger, Bernard Gendron, Jean-Yves Potvin, S. Raghavan, Patrick Soriano:
Tabu Search for a Network Loading Problem with Multiple Facilities. J. Heuristics 6(2): 253-267 (2000) - [j24]Soumia Ichoua, Michel Gendreau, Jean-Yves Potvin:
Diversion Issues in Real-Time Vehicle Dispatching. Transp. Sci. 34(4): 426-438 (2000)
1990 – 1999
- 1999
- [j23]Gilles Pesant, Michel Gendreau, Jean-Yves Potvin, Jean-Marc Rousseau:
On the flexibility of constraint programming models: From single to multiple time windows for the traveling salesman problem. Eur. J. Oper. Res. 117(2): 253-263 (1999) - [j22]Michel Gendreau, François Guertin, Jean-Yves Potvin, Éric D. Taillard:
Parallel Tabu Search for Real-Time Vehicle Routing and Dispatching. Transp. Sci. 33(4): 381-390 (1999) - 1998
- [j21]Gilles Pesant, Michel Gendreau, Jean-Yves Potvin, Jean-Marc Rousseau:
An Exact Constraint Logic Programming Algorithm for the Traveling Salesman Problem with Time Windows. Transp. Sci. 32(1): 12-29 (1998) - [j20]Ilham Benyahia, Jean-Yves Potvin:
Decision support for vehicle dispatching using genetic programming. IEEE Trans. Syst. Man Cybern. Part A 28(3): 306-314 (1998) - 1997
- [j19]Gilbert Laporte, Jean-Yves Potvin, Florence Quilleret:
A tabu search heuristic using genetic diversification for the clustered traveling salesman problem. J. Heuristics 2(3): 187-200 (1997) - [j18]Christophe Duhamel, Jean-Yves Potvin, Jean-Marc Rousseau:
A Tabu Search Heuristic for the Vehicle Routing Problem with Backhauls and Time Windows. Transp. Sci. 31(1): 49-59 (1997) - [j17]Éric D. Taillard, Philippe Badeau, Michel Gendreau, François Guertin, Jean-Yves Potvin:
A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows. Transp. Sci. 31(2): 170-186 (1997) - 1996
- [j16]Jean-Yves Potvin:
Genetic algorithms for the traveling salesman problem. Ann. Oper. Res. 63(3): 337-370 (1996) - [j15]Jean-Yves Potvin, Danny Dubé, Christian Robillard:
A Hybrid Approach to Vehicle Routing Using Neural Networks and Genetic Algorithms. Appl. Intell. 6(3): 241-252 (1996) - [j14]Jean-Yves Potvin, Christophe Duhamel, François Guertin:
A Genetic Algorithm for Vehicle Routing with Backhauling. Appl. Intell. 6(4): 345-355 (1996) - [j13]Sam R. Thangiah, Jean-Yves Potvin, Tong Sun:
Heuristic approaches to vehicle routing with backhauls and time windows. Comput. Oper. Res. 23(11): 1043-1057 (1996) - [j12]Tanguy Kervahut, Jean-Yves Potvin:
An interactive-graphic environment for automatic generation of decision trees. Decis. Support Syst. 18(2): 117-134 (1996) - [j11]Jean-Yves Potvin, Tanguy Kervahut, Bruno-Laurent Garcia, Jean-Marc Rousseau:
The Vehicle Routing Problem with Time Windows Part I: Tabu Search. INFORMS J. Comput. 8(2): 158-164 (1996) - [j10]Jean-Yves Potvin, Samy Bengio:
The Vehicle Routing Problem with Time Windows Part II: Genetic Search. INFORMS J. Comput. 8(2): 165-172 (1996) - 1995
- [j9]Yu Shen, Jean-Yves Potvin, Jean-Marc Rousseau, Serge Roy:
A computer assistant for vehicle dispatching with learning capabilities. Ann. Oper. Res. 61(1): 189-211 (1995) - [j8]Jean-Yves Potvin, Christian Robillard:
Clustering for vehicle routing with a competitive neural network. Neurocomputing 8(2): 125-139 (1995) - 1994
- [j7]Bruno-Laurent Garcia, Jean-Yves Potvin, Jean-Marc Rousseau:
A parallel implementation of the Tabu search heuristic for vehicle routing problems with time window constraints. Comput. Oper. Res. 21(9): 1025-1033 (1994) - [j6]Jean-Yves Potvin, Guy Lapalme, Jean-Marc Rousseau:
A microcomputer assistant for the development of vehicle routing and scheduling heuristics. Decis. Support Syst. 12(1): 41-56 (1994) - [c3]Jean-Yves Potvin, Danny Dubé:
Improving a Vehicle Routing Heuristic Through Genetic Search. International Conference on Evolutionary Computation 1994: 194-199 - 1993
- [j5]Jean-Yves Potvin, Gina Dufour, Jean-Marc Rousseau:
Learning vehicle dispatching with linear programming models. Comput. Oper. Res. 20(4): 371-380 (1993) - [j4]Christian Foisy, Jean-Yves Potvin:
Implementing an insertion heuristic for vehicle routing on parallel hardware. Comput. Oper. Res. 20(7): 737-745 (1993) - [j3]Jean-Yves Potvin:
State-of-the-Art Survey - The Traveling Salesman Problem: A Neural Network Perspective. INFORMS J. Comput. 5(4): 328-348 (1993) - 1992
- [j2]Jean-Yves Potvin, Yu Shen, Jean-Marc Rousseau:
Neural networks for automated vehicle dispatching. Comput. Oper. Res. 19(3-4): 267-276 (1992) - [p1]Jean-Yves Potvin, Jean-Marc Rousseau:
Constraint-Directed Search for the Advanced Request Dial-a-Ride Problem with Service Quality Constraints. Computer Science and Operations Research 1992: 457-474 - 1990
- [c2]Stephen F. Smith, Nicola Muscettola, Dirk C. Matthys, Peng Si Ow, Jean-Yves Potvin:
OPIS: An Opportunistic Factory Scheduling System. IEA/AIE (Vol. 1) 1990: 268-274
1980 – 1989
- 1989
- [j1]Jean-Yves Potvin, Guy Lapalme, Jean-Marc Rousseau:
Alto: A computer system for the design of vehicle routing algorithms. Comput. Oper. Res. 16(5): 451-470 (1989) - [c1]Jean-Yves Potvin, Guy Lapalme, Jean-Marc Rousseau:
Automatic selection and design of efficient vehicle routing algorithms. IEA/AIE (2) 1989: 523-527
Coauthor Index
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 2023-10-01 22:33 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint