323,655 research outputs found
Erratum: A Tabu search heuristic for the vehicle routing problem with two-dimensional loading constraints
No full textIn the article, “A Tabu Search Heuristic for the Vehicle Routing Problem with Two-Dimensional Loading Constraints” by M. Gendreau et al., which appeared in the January issue of Networks (Networks 51 (2008), 4–18), the last author’s name was misspelled
Gendreau Francis — Essai sur la recherche démographique à Madagascar.
No full textS. T. Gendreau Francis — Essai sur la recherche démographique à Madagascar.. In: Population, 25ᵉ année, n°3, 1970. p. 670
Théodore S. Beardsley, Hispano-Classical Translations printed between 1482 and 1699
No full textGendreau-Massaloux Michèle. Théodore S. Beardsley, Hispano-Classical Translations printed between 1482 and 1699. In: Bulletin Hispanique, tome 73, n°3-4, 1971. pp. 486-488
Gendreau et al. (2006) data set
No full textGendreau et al.’s (2006) benchmark instances consist of 27 problem instances, with the number of customers varying between 15 and 100. The nodes’ coordinates, the weights demanded by the customers, and the vehicle weight capacities were taken from the CVRP instances of Toth and Vigo (2002). The loading space was defined as W = 25, H = 30, and L = 60. The loading space of the vehicles and widths, lengths, and heights of requested items were generated by Gendreau et al. (2006)
Simulation-based optimization of agent scheduling in multiskill call centers.
No full textWe examine and compare simulation-based algorithms for solvingthe agent scheduling problem in a multiskill call center.This problem consists in minimizing the total costs of agents underconstraints on the expected service level per call type,per period, and aggregated.We propose a solution approach that combines simulation withinteger or linear programming, with cut generation.In our numerical experiments with realistic problem instances,this approach performs better than all other methods proposedpreviously for this problem.We also show that the two-step approach, which is the standard methodfor solving this problem, sometimes yield solutions that arehighly suboptimal and inferior to those obtained by our proposed method.<br/
Gendreau et al. (2006) data set
No full textGendreau et al.’s (2006) benchmark instances consist of 27 problem instances, with the number of customers varying between 15 and 100. The nodes’ coordinates, the weights demanded by the customers, and the vehicle weight capacities were taken from the CVRP instances of Toth and Vigo (2002). The loading space was defined as W = 25, H = 30, and L = 60. The loading space of the vehicles and widths, lengths, and heights of requested items were generated by Gendreau et al. (2006).THIS DATASET IS ARCHIVED AT DANS/EASY, BUT NOT ACCESSIBLE HERE. TO VIEW A LIST OF FILES AND ACCESS THE FILES IN THIS DATASET CLICK ON THE DOI-LINK ABOV
Optimizing daily agent scheduling in a multiskill call center
No full textWe examine and compare simulation-based algorithms for solving the agent scheduling problem in a multiskill call center. This problem consists in minimizing the total costs of agents under constraints on the expected service level per call type, per period, and aggregated. We propose a solution approach that combines simulation with integer or linear programming, with cut generation. In our numerical experiments with realistic problem instances, this approach performs better than all other methods proposed previously for this problem. We also show that the two-step approach, which is the standard method for solving this problem, sometimes yield solutions that are highly suboptimal and inferior to those obtained by our proposed method.<br/
A tabu search heuristic for the vehicle routing problem with two-dimensional loading constraints
No full textThis article addresses the well-known Capacitated Vehicle Routing Problem (CVRP), in the special case where the demand of a customer consists of a certain number of two-dimensional weighted items. The problem calls for the minimization of the cost of transportation needed for the delivery of the goods demanded by the customers, and carried out by a fleet of vehicles based at a central depot. In order to accommodate all items on the vehicles, a feasibility check of the two-dimensional packing (2L) must be executed on each vehicle. The overall problem, denoted as 2L-CVRP, is NP-hard and particularly difficult to solve in practice. We propose a Tabu Search algorithm, in which the loading component of the problem is solved through heuristics, lower bounds, and a truncated branch-and-bound procedure. The effectiveness of the algorithm is demonstrated through extensivecomputational experiments
Diffusive author(s), cohesive author: Analysis of S/N (1994)
No full textThis study indicates the ways in which various aspects of the author(s) are brought forth in Dumb type’s performance art, the S/N production. Previous research has suggested a non-hierarchical organization of Dumb type and the absence of a “privileged author” in Dumb type’s collaborative work, S/N. However, the results that I have investigated from member’s interviews on the creative process of S/N along with my analysis of the recorded images of S/N, indicate a different aspect of the author(s). First, S/N was created through, so to speak, the collective ideas of the members of Dumb type. Further, S/N has at least nine quotations from previous performances, installations, and printed writings, besides the work-in-progress technique. Explicating one of the “author functions” as given by Michel Foucault, each text has plural subjects of the author. However, it has been revealed from members’ interviews that Teiji Furuhashi had a decision-making role in selecting the members’ ideas within the performance. Since then, S/N has had plural subjects of creation; however, Furuhashi is one of the subjects of creation along with the “privileged author.” S/N has plural authors (diffusive authors) yet at the same time, it has a “privileged author,” Teiji Furuhashi (cohesive author)
- …
