Pagination
Voir le détail
Crainic, Teodor Gabriel
facility and the traffic intensity aiming to use it (e.g., Crainic and Gendreau, 1986; Powell, 1986b; Powell and Humblet, 1986; Crainic and Que rin, 1988), for inclusion in non-linear SND formulations (e.g.Crainic et al., 1984; Crainic and Rousseau, 1986; Bektas et al., 2010).When system-wide planning issues started to be
it is notoriously hard to solve even in its deterministic (Crainic et al., 2021b; Crainic and Gendron, 2021; Crainic and Gendreau, 2021) and sequential-stochastic (Hewitt et al., 2021) forms.The MCFNDSD is defined on a directed graph consisting a set of nodes N and a set of potential arcs A.In this problem, a set of
Vidal, Thibaut, 1986- auteur
, de veloppe en de tail dans Ahuja et al. (2002) et Pisinger et Ropke (2010). D’autres revues deitte rature sures recherchesocales poure VRP peuvent e tre trouve es dans Van Breedam (1995), Kindervater et Savelsbergh (1997), Golden et Wasil (2002), La- porte et Semet (2002), Bra ysy et Gendreau (2005b), Funke et al
remarkable difficulty.Most exact methods are still rarely able to solve instances of more than 100 customers.As a result, a wide range of heuristics and meta- heuristics (see the surveys of Bra ysy and Gendreau 2005b,a, Gendreau and Tarantilis 2010, Vidal et al.2013b) have been proposed to address real-life settings
Sarayloo, Fatemeh
Metaheuristics for Fixed-Charge Net- work Design.T.G.Crainic, M.Gendreau, B.Gendron, eds., Network Design with Applications in Transportation and Logistics , chap.4.Springer, Boston, 91–138.Crainic, T.G, M.Gendreau, J.M.Farvolden.2000.A simplex-based tabu search method for capacitated network design.INFORMS Journal on Computing 12
choices. As illustrated by numerous reviews (Bra ysy and Gendreau 2005b,a, Francis et al. 2008, Gendreau et al. 2008, Gendreau and Tarantilis 2010, for the most recent), almost every prominent meta-heuristic paradigm, including evolutionary methods, ant colony optimization, tabu search, simulated anneal- ing, other improved
surveys (see Baldacci et al. 2007, Cordeau et al. 2007, Gendreau et al. 2008, Eksioglu et al. 2009, Potvin 2009 and Laporte 2009, for the most recent) and books (Golden and Assad 1988, Toth and Vigo 2002b, Golden et al. 2008). Today, the best exact methods for VRP are stillimited to relatively small problems. For example
queuing models (engineering procedures is some cases), contin- uous and convex functions are approximated to represent the behaviour of the facility under study (e.g., Crainic and Gendreau, 1986; Powell, 1986b; Powell and Humblet, 1986; Crainic and Quérin, 1988).Figure 3 illustrates such an idealized congestion function
Jabali, Ola, 1980- auteur
been proposed (Laporte, 2009). A good example is the Vehicle Routing Problem with Time Windows (VRPTW), in which each customer needs to be served within his time window. In most VRPTW papers surveyed by Bra ysy and Gendreau (2005a,b), the objective is to find the minimum number of required vehicles while adhering to
, T.G., M.Gendreau.2021.Heuristics and Metaheuristics for Fixed-Charge Net- work Design.T.G.Crainic, M.Gendreau, B.Gendron, eds., Network Design with Applications in Transportation and Logistics , chap.4.Springer, Boston, 91–138.Crainic, T.G., M.Gendreau, B.Gendron.2021c.Fixed-Charge Network Design Prob-ems
.T.G.Crainic and M.Hewitt.Service Network Design.In T.G.Crainic, M.Gendreau, and B.Gen- dron, editors, Network Design with Applications in Transportation and Logistics, chapter 12, pages 347–382.Springer, Boston, 2021.T.G.Crainic and G.Laporte.Planning Models for Freight Transportation.European Journal of Operational Research, 97
a set of geographically scattered customers within allowed time intervals.The VRPTW makes for one of the most intensively studied combinatorial optimization problem, as underlined by dozens ofiterature reviews on the subject (see Kallehauge et al.2005, Bra ysy and Gendreau 2005b,a, Gendreau and Tarantilis 2010, for the
:1164–1175, 2019.[6] T.G.Crainic, G.Perboli, and N.Ricciardi.City Logistics.In T.G.Crainic, M.Gendreau, and B.Gendron, editors, Network De- sign with Applications in Transportation and Logistics, chapter 16, pages 507–537.Springer, Boston, 2021.[7] V.Culpan.Wired.Watch how Swiss Post is delivering with drones.https://www
Légaré, Sophie
PROCÉDURE D’APPLICATION CADRE D’INTERVENTION EN MATIÈRE DE TARIFICATION Ministère de’Environnement Direction de’analyse économique et dea tarification Mars 2002 (Révisé en 2003) Équipe de réalisation Conception et rédaction : Sophie Légaré et Dick McCollough Édition : Huguette Gendreau et Francine B
(see Kallehauge et al.2005, Bra ysy and Gendreau 2005a,b, Gendreau and Tarantilis 2010, for the most recent).Timing arises as a subproblem when checking the feasibility, or estimating the minimal amount of violation with respect to time-windows, on the sequences (itineraries) produced in the course of the search
Gauvin, Charles
Gauvin a,b,d Erick Delage a,c Michel Gendreau b,d a GERAD b Department of Mathematics and Industrial Engineering, Polytechnique Montre al, Montre al (Que bec) Canada H3C 3A7 c HEC Montre al, Montre al (Que bec) Canada, H3T 2A7 d CIRRELT charles.gauvin@polymtl.ca erick.delage@hec.ca michel.gendreau@cirrelt.net March 2017
Gendreau, Michel, 1955- auteur
dates back to the 1960’s.For an overview on early developments, we refer readers to the surveys of Golden and Assad (1986), Desrochers et al.(1988), Desrosiers et al.(1995), and Cordeau et al.(2002).The more recent surveys of Bräysy and Gendreau (2005a,b) and Bräysy et al.(2004a) review the algorithmic developments in the
available to return to the depot (theaboratory).Time constraints in customers’ service have traditionally been addressed through the definition of time windows –TW (see, for example Bräysy & Gendreau 2005a,b).Some practical contexts have raised a need to define multiple (but independent) time windows for each customer to
dea ville, \u2018gauche, étaient aménagéses bureaux dep police Ps \u2019 1685 Georges-M.Stearns, 1895-1096 une vaste salle où se sont déroulées particulièrementies municipale et, bien sûr,es ceflules! A.B.Gendreau, 1886-1888 Napoléon Lemieux, 1896-1897 assemblées du Conseil municipal, des assemblées poli- \u2018
