A new approach to solving the multiple traveling salesperson problem using genetic algorithms (Q2432849): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejor.2005.04.027 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2036573713 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pathology of Traveling-Salesman Subtour-Elimination Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Genetic algorithms and traveling salesman problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4730766 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4289899 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692508 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3829367 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4079017 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The efficiency of hybrid mutation genetic algorithm for the travelling salesman problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3677509 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid genetic algorithm for the open shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A genetic algorithm for service level based vehicle scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient genetic algorithm for the traveling salesman problem with precedence constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Genetic algorithm crossover operators for ordering applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Genetic algorithms for the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Performance characteristics of alternative genetic algorithmic approaches to the traveling salesman problem using path representation: An empirical study / rank
 
Normal rank
Property / cites work
 
Property / cites work: A multiple traveling salesman problem model for hot rolling scheduling in Shanghai Baoshan Iron \& Steel Complex / rank
 
Normal rank

Latest revision as of 22:14, 24 June 2024

scientific article
Language Label Description Also known as
English
A new approach to solving the multiple traveling salesperson problem using genetic algorithms
scientific article

    Statements

    A new approach to solving the multiple traveling salesperson problem using genetic algorithms (English)
    0 references
    0 references
    0 references
    25 October 2006
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    genetic algorithms
    0 references
    scheduling
    0 references
    traveling salesman
    0 references
    0 references