FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W2183699609> ?p ?o ?g. }

• W2183699609 abstract "The Two-Echelon Routing Problem constitutes a class of combinatorial optimization problems with applications in many different fields such as city logistic planning, intermodal transportation, postal and parcel delivery distribution systems and so on. This thesis contains:- a survey of the main contributions related to the two-echelon routing, focusing on the Two-Echelon Location Routing Problem, on the Two-Echelon Vehicle Problem and on the Truck and Trailer Routing Problem;- an analysis of a particular version of the Two-Echelon Location Routing Problem with single source, referred as Single Vehicle Two-Echelon Location Routing Problem, with two mathematical formulations and a heuristic algorithm;- some computational experiments aiming at test the effectiveness of the formulations and the heuristic algorithm.The thesis is divided in three parts:- a literature review of the Two-Echelon Location Routing Problem, of the Two-Echelon Vehicle Routing Problem and of the Truck and Trailer Routing Problem. The Two-Echelon Location Routing Problem refers to a class of problem directly derived from the well-known Location Routing Problem in which two sets of facilities must be located and two levels of routing have to be considered. The Two-Echelon Vehicle Routing Problem is derived from the Vehicle Routing Problem. In this class of problems the distribution of freight is managed through a set of satellites, where operation of consolidation, and/or transhipment and/or storage are performed. The Truck and Trailer Routing Problem models a distribution system in which a vehicle fleet, composed by truck units and trailer units, is used to serve the demand of a set of customers, some of which are accessible only by a truck without trailer;- the description of the Single Vehicle Two-Echelon Location Routing Problem with emphasis on its structure and its components, plus the introduction of two integer programming formulations to determine the optimal location and the optimal number of a set of capacitated facilities, the assignment of customers to these facilities and the related routes. Four sets of instances are adapted from the literature and the results of proposed formulation are reported, comparing their performances in terms of solution quality and computation times.- the introduction of a heuristic algorithm to solve the problem. Five variants of the algorithm are developed, differing from each other for the assignment procedures of the customers to the satellites. The results provided by such algorithm are compared with the optimal solutions, or in some cases with the best lower bounds provided by CPLEX solving the two integer models." @default.
• W2183699609 created "2016-06-24" @default.
• W2183699609 creator A5069068616 @default.
• W2183699609 date "2014-02-07" @default.
• W2183699609 modified "2023-09-26" @default.
• W2183699609 title "The Two-Echelon Location Routing Problems: State of the Art, Models and Algorithms" @default.
• W2183699609 cites W105709917 @default.
• W2183699609 cites W1208385249 @default.
• W2183699609 cites W1485881041 @default.
• W2183699609 cites W1489702587 @default.
• W2183699609 cites W1490008947 @default.
• W2183699609 cites W1513139631 @default.
• W2183699609 cites W1514596906 @default.
• W2183699609 cites W1566618587 @default.
• W2183699609 cites W1571193596 @default.
• W2183699609 cites W1921374842 @default.
• W2183699609 cites W1969384728 @default.
• W2183699609 cites W1970366397 @default.
• W2183699609 cites W197064018 @default.
• W2183699609 cites W1976984345 @default.
• W2183699609 cites W1978558628 @default.
• W2183699609 cites W1982121258 @default.
• W2183699609 cites W1988345713 @default.
• W2183699609 cites W1989277804 @default.
• W2183699609 cites W1989974478 @default.
• W2183699609 cites W1990293270 @default.
• W2183699609 cites W1990849564 @default.
• W2183699609 cites W1994515816 @default.
• W2183699609 cites W1997833031 @default.
• W2183699609 cites W2003677825 @default.
• W2183699609 cites W2006527299 @default.
• W2183699609 cites W2010587722 @default.
• W2183699609 cites W2022179164 @default.
• W2183699609 cites W2034456245 @default.
• W2183699609 cites W2036815904 @default.
• W2183699609 cites W2038947920 @default.
• W2183699609 cites W2039006033 @default.
• W2183699609 cites W2040546552 @default.
• W2183699609 cites W2043155988 @default.
• W2183699609 cites W2045902051 @default.
• W2183699609 cites W2052656908 @default.
• W2183699609 cites W2054646263 @default.
• W2183699609 cites W2055539533 @default.
• W2183699609 cites W2064716473 @default.
• W2183699609 cites W2074765680 @default.
• W2183699609 cites W2082056262 @default.
• W2183699609 cites W2086503610 @default.
• W2183699609 cites W2096658257 @default.
• W2183699609 cites W2118055193 @default.
• W2183699609 cites W2120018826 @default.
• W2183699609 cites W2136284166 @default.
• W2183699609 cites W2143058845 @default.
• W2183699609 cites W2146004814 @default.
• W2183699609 cites W2147090984 @default.
• W2183699609 cites W2148673189 @default.
• W2183699609 cites W2164177447 @default.
• W2183699609 cites W2165941447 @default.
• W2183699609 cites W2168210873 @default.
• W2183699609 cites W2300436762 @default.
• W2183699609 cites W2500153114 @default.
• W2183699609 cites W3036211873 @default.
• W2183699609 hasPublicationYear "2014" @default.
• W2183699609 type Work @default.
• W2183699609 sameAs 2183699609 @default.
• W2183699609 citedByCount "1" @default.
• W2183699609 countsByYear W21836996092016 @default.
• W2183699609 crossrefType "journal-article" @default.
• W2183699609 hasAuthorship W2183699609A5069068616 @default.
• W2183699609 hasConcept C104954878 @default.
• W2183699609 hasConcept C123784306 @default.
• W2183699609 hasConcept C126255220 @default.
• W2183699609 hasConcept C127413603 @default.
• W2183699609 hasConcept C146978453 @default.
• W2183699609 hasConcept C204948658 @default.
• W2183699609 hasConcept C2779101595 @default.
• W2183699609 hasConcept C29436982 @default.
• W2183699609 hasConcept C31258907 @default.
• W2183699609 hasConcept C33923547 @default.
• W2183699609 hasConcept C41008148 @default.
• W2183699609 hasConcept C42475967 @default.
• W2183699609 hasConcept C52121051 @default.
• W2183699609 hasConcept C74172769 @default.
• W2183699609 hasConcept C89305328 @default.
• W2183699609 hasConceptScore W2183699609C104954878 @default.
• W2183699609 hasConceptScore W2183699609C123784306 @default.
• W2183699609 hasConceptScore W2183699609C126255220 @default.
• W2183699609 hasConceptScore W2183699609C127413603 @default.
• W2183699609 hasConceptScore W2183699609C146978453 @default.
• W2183699609 hasConceptScore W2183699609C204948658 @default.
• W2183699609 hasConceptScore W2183699609C2779101595 @default.
• W2183699609 hasConceptScore W2183699609C29436982 @default.
• W2183699609 hasConceptScore W2183699609C31258907 @default.
• W2183699609 hasConceptScore W2183699609C33923547 @default.
• W2183699609 hasConceptScore W2183699609C41008148 @default.
• W2183699609 hasConceptScore W2183699609C42475967 @default.
• W2183699609 hasConceptScore W2183699609C52121051 @default.
• W2183699609 hasConceptScore W2183699609C74172769 @default.
• W2183699609 hasConceptScore W2183699609C89305328 @default.
• W2183699609 hasLocation W21836996091 @default.
• W2183699609 hasOpenAccess W2183699609 @default.

• next