Einloggen

Thematische Bibliographien / Fixed fleet / Zeitschriftenartikel

Um die anderen Arten von Veröffentlichungen zu diesem Thema anzuzeigen, folgen Sie diesem Link: Fixed fleet.

Zeitschriftenartikel zum Thema „Fixed fleet“

Autor: Grafiati

Veröffentlicht am 28. Juni 2021

Zuletzt aktualisiert am 12. Februar 2022

Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an

Wählen Sie eine Art der Quelle aus:

Machen Sie sich mit Top-50 Zeitschriftenartikel für die Forschung zum Thema "Fixed fleet" bekannt.

Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.

Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.

Sehen Sie die Zeitschriftenartikel für verschiedene Spezialgebieten durch und erstellen Sie Ihre Bibliographie auf korrekte Weise.

1

Cissé, A. A., S. Gourguet, L. Doyen, F. Blanchard und J. C. Péreau. „A bio-economic model for the ecosystem-based management of the coastal fishery in French Guiana“. Environment and Development Economics 18, Nr. 3 (28.02.2013): 245–69. http://dx.doi.org/10.1017/s1355770x13000065.

Der volle Inhalt der Quelle

Annotation:

AbstractThis paper offers a theoretical and empirical model of ecosystem-based fishery management. A multi-species and multi-fleet model integrating Lotka–Volterra trophic dynamics as well as production and profit assessments is developed and applied to the coastal fishery of French Guiana. This small-scale fishery constitutes a challenging example with high fish biodiversity, several non-selective fleets and a potentially increasing local food demand due to demographic growth. The dynamic model is calibrated with 13 species and four fleets using monthly catch and effort data from 2006 to 2009. Several contrasted fishing scenarios including status quo, total closure, economic and viable strategies are then simulated. They are compared from the viewpoints of both biodiversity preservation and socioeconomic performance, assuming fixed landing prices and fixed costs. We show that fishing outputs, including food supply and fleet profitability, can be sustained on average but a loss of species cannot be avoided.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

2

Kwon, Yong-Ju, Young-Jae Choi und Dong-Ho Lee. „Heterogeneous fixed fleet vehicle routing considering carbon emission“. Transportation Research Part D: Transport and Environment 23 (August 2013): 81–89. http://dx.doi.org/10.1016/j.trd.2013.04.001.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

3

Mendes, Lucas Mestres, Manel Rivera Bennàssar und Joseph Y. J. Chow. „Comparison of Light Rail Streetcar Against Shared Autonomous Vehicle Fleet for Brooklyn–Queens Connector in New York City“. Transportation Research Record: Journal of the Transportation Research Board 2650, Nr. 1 (Januar 2017): 142–51. http://dx.doi.org/10.3141/2650-17.

Der volle Inhalt der Quelle

Annotation:

Policy makers predict that autonomous vehicles will have significant market penetration in the next decade or so. In several simulation studies shared autonomous vehicle fleets have been shown to be effective public transit alternatives. This study compared the effectiveness of a shared autonomous vehicle fleet with an upcoming transit project proposed in New York City, the Brooklyn–Queens Connector light rail project. The study developed an event-based simulation model to compare the performance of the shared autonomous vehicle system with the light rail system under the same demand patterns, route alignment, and operating speeds. The simulation experiments revealed that a shared autonomous vehicle fleet of 500 vehicles of 12-person capacity (consistent with the EZ10 vehicle) would be needed to match the 39-vehicle light rail system if operated as a fixed-route system. However, as a demand-responsive system, a fleet of only 150 vehicles would lead to the same total travel time (22 min) as the 39-vehicle fleet light rail system. Furthermore, a fleet of 450 12-person vehicles in a demand-responsive operation would have the same average wait times while reducing total travel times by 36%. The implications for system resiliency, idle vehicle allocation, and vehicle modularity are discussed.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

4

Matthopoulos, Panagiotis Petros, und Stella Sofianopoulou. „A Firefly Algorithm for the Heterogeneous Fixed Fleet VRP“. International Journal of Industrial and Systems Engineering 33, Nr. 2 (2019): 1. http://dx.doi.org/10.1504/ijise.2019.10016698.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

5

Marchal, Paul, L. Richard Little und Olivier Thébaud. „Quota allocation in mixed fisheries: a bioeconomic modelling approach applied to the Channel flatfish fisheries“. ICES Journal of Marine Science 68, Nr. 7 (06.06.2011): 1580–91. http://dx.doi.org/10.1093/icesjms/fsr096.

Der volle Inhalt der Quelle

Annotation:

Abstract Marchal, P., Little, L. R., and Thébaud, O. 2011. Quota allocation in mixed fisheries: a bioeconomic modelling approach applied to the Channel flatfish fisheries. – ICES Journal of Marine Science, 68: 1580–1591. A simulation modelling approach is used to assess the respective performances of different regimes of quota allocation (fixed or transferable), quota ownership (owned or not by fishers), and taxation for catching fish above quota. The simulations account for a variety of fleet behaviours (ranging from fixed by tradition to dynamic economics-driven). The modelling framework is applied to the Channel flatfish mixed fisheries. Transferable quota allocation regimes would particularly benefit small netters and beam trawlers, which would achieve a profit of €50–150 million without compromising the conservation of eastern Channel sole, but it could impair the sustainability of other stocks. If quota is owned by fishers, the least fishing-efficient fleet stops fishing, but makes substantial profit from leasing quotas to beam trawlers and to small and large netters, which remain actively fishing. The highest economic return for quota owners (€200–300 million) is achieved when effort allocation is fixed by tradition. The profit achieved by small netters is greatest when fleets are almost entirely economics-driven. Increasing overquota landing taxes generally leads to conservation benefits for all stocks, but at the expense of lower profitability for the fishery overall.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

6

Maravelias, Christos D., Richard Hillary, John Haralabous und Efthymia V. Tsitsika. „Stochastic bioeconomic modelling of alternative management measures for anchovy in the Mediterranean Sea“. ICES Journal of Marine Science 67, Nr. 6 (12.03.2010): 1291–300. http://dx.doi.org/10.1093/icesjms/fsq018.

Der volle Inhalt der Quelle

Annotation:

Abstract Maravelias, C. D., Hillary, R., Haralabous, J., and Tsitsika, E. V. 2010. Stochastic bioeconomic modelling of alternative management measures for anchovy in the Mediterranean Sea. – ICES Journal of Marine Science, 67: 1291–1300. The purse-seine fishery for anchovy in the Aegean Sea consists of two main fleet segments (12–24 and 24–40 m vessels); this paper investigates economically and biologically preferable effort and capacity scenarios for the fishery. Attention is paid to a bioeconomic analysis of fleets composed of segments with varying levels of efficiency (in terms of catch rate) and costs (fixed and variable) and the role this might play in optimal effort allocation at a fleet level. An age-structured stochastic bioeconomic operating model for Aegean anchovy (Engraulis encrasicolus) is constructed. It attempts to account robustly for the multiple uncertainties in the system, including (i) the effort–fishing mortality relationship, (ii) the selectivity, and (iii) the stock–recruit dynamics of the population. A method is proposed for determining the economically optimal level of long-term effort in a fishery such as this, with similar characteristics in terms of stock dynamics, fishery, and markets. Lower values of effort and capacity are predicted to yield greater future profit when viewing the fleet in its entirety, but even lower values may be advisable to maintain the long-term biological integrity of the stock. The results may prove useful in balancing the productivity of the stock with the harvesting capacity of the fleet, while managing to ensure the long-term profitability of the fleet along with the sustainability of the resource.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

7

Avila-Torres, Paulina A., Nancy M. Arratia-Martinez und Efraín Ruiz-y-Ruiz. „The Inventory Routing Problem with Priorities and Fixed Heterogeneous Fleet“. Applied Sciences 10, Nr. 10 (19.05.2020): 3502. http://dx.doi.org/10.3390/app10103502.

Der volle Inhalt der Quelle

Annotation:

This paper presents a new combinatorial optimization problem, the inventory routing problem with priorities, and a fixed heterogeneous fleet. In this problem, a particular set of customers has to be served before the rest of the customers using vehicles with different capacities. The problem is inspired by the current situation faced by a specialized gas distribution company in the northeast region of Mexico. The company produces and distributes three main products, although this paper focuses only on the oxygen distribution problem. The company delivers oxygen to industrial customers, as well as hospitals and other medical facilities. Due to Mexican government regulations, the company requires prioritizing deliveries to hospitals and medical facilities over its industrial customers. Therefore, the company is obliged to satisfy the customers demand considering inventory levels and priority constraints while minimizing the inventory and routing cost. An integer programming model is proposed to solve the problem. The model minimizes the total distribution cost while considering inventory level, priority constraints, and a fixed fleet of vehicles with different capacities. Finally, computational experiments were carried out using benchmark instances to validate the correctness of the proposed model and to analyze the effect of priorities on the total distribution cost. Finally, actual customers of the company were selected to show the effectiveness of the proposed model to solve real-world problems.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

8

Tsakiri, M., M. Stewart, T. Forward, D. Sandison und J. Walker. „Urban Fleet Monitoring with GPS and GLONASS“. Journal of Navigation 51, Nr. 3 (September 1998): 382–93. http://dx.doi.org/10.1017/s0373463398007929.

Der volle Inhalt der Quelle

Annotation:

The increasing volume of traffic in urban areas has resulted in steady growth of the mean driving time on fixed routes. Longer driving times lead to significantly higher transportation costs, particularly for vehicle fleets, where efficiency in the distribution of their transport tasks is important in staying competitive in the market. For bus fleets, the optimal control and command of the vehicles is, as well as the economic requirements, a basic function of their general mission. The Global Positioning System (GPS) allows reliable and accurate positioning of public transport vehicles except within the physical limitations imposed by built-up city ‘urban canyons’. With a view to the next generation of satellite positioning systems for public transport fleet management, this paper highlights the limitations imposed on current GPS systems operating in the urban canyon. The capabilities of a future positioning system operating in this type of environment are discussed. It is suggested that such a system could comprise receivers capable of integrating the Global Positioning System (GPS) and the Russian equivalent, the Global Navigation Satellite System (GLONASS), and relatively cheap dead-reckoning sensors.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

9

García Albarracín, Andrés Felipe, und Daniel Jaramillo-Ramírez. „Limited-Stop High-Frequency Service Design: Reducing In-Vehicle Congestion“. Journal of Advanced Transportation 2019 (02.07.2019): 1–9. http://dx.doi.org/10.1155/2019/5745870.

Der volle Inhalt der Quelle

Annotation:

Limited-Stop (LS) bus services have recently proved to be essential for improving user welfare and reducing operators’ costs in many cities. The design of LS services has been mainly focused on increasing fleet efficiency and reducing the passengers’ travel time. In this work, we change the focus of LS service design towards the user’s comfort. Given a fixed-size fleet (fixed costs) and a fixed demand on a very high-frequency bus corridor, we propose an algorithm to minimize the peak load profile, combining the usual All-Stop (AS) and one additional LS service, finding the set of stops for the LS service and the fleet split. The strategy is proved in a set of statistically generated corridors, showing average capacity reductions > 20% at a cost of a marginal travel time increase. Analyzing the peak value in the load profile of all simulated corridors, the number of cases where the majority of users would find a seat on the bus increases from 15% to 53%, making the services much more attractive without increasing the costs.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

10

Luo, Xiaoling, Yangsheng Jiang, Zhihong Yao, Youhua Tang und Yuan Liu. „Designing Limited-Stop Transit Service with Fixed Fleet Size in Peak Hours by Exploiting Transit Data“. Transportation Research Record: Journal of the Transportation Research Board 2647, Nr. 1 (Januar 2017): 134–41. http://dx.doi.org/10.3141/2647-16.

Der volle Inhalt der Quelle

Annotation:

Efficiently designed limited-stop transit service is an attractive way to respond to high commuter travel demand in which trips concentrate on a few origin–destination pairs during peak hours. Such service is redesigned in many metropolises in China. Some research has dealt with this situation; bus fleet size was assumed to be unlimited, and the research was concerned with the average daily passenger flow rather than the specific average peak hour travel demand. In contrast to previous work, this paper presents an approach to design limited-stop transit service with the existing available fleet size from current normal service and focuses only on peak hour travel demand extracted through exploitation of transit data. First, a model for limited-stop service was proposed to minimize user costs through existing fixed fleet size. A heuristic algorithm was developed to search the transit line structure for limited-stop service instead of selecting lines from the predefined set. Next, a case in Chengdu, China, was tested. The results indicate that up to 9.32% of total travel time can be saved with the fixed fleet size when limited-stop transit service is applied. Finally, different proportions of commuter flow and different travel behaviors are discussed to illustrate the performance of limited-stop service for different scenarios.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

11

Kritzinger, Stefanie, Fabien Tricoire, Karl F. Doerner, Richard F. Hartl und Thomas Stützle. „A unified framework for routing problems with a fixed fleet size“. International Journal of Metaheuristics 6, Nr. 3 (2017): 160. http://dx.doi.org/10.1504/ijmheur.2017.085124.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

12

Stützle, Thomas, Richard F. Hartl, Karl F. Doerner, Stefanie Kritzinger und Fabien Tricoire. „A unified framework for routing problems with a fixed fleet size“. International Journal of Metaheuristics 6, Nr. 3 (2017): 160. http://dx.doi.org/10.1504/ijmheur.2017.10005651.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

13

Gabin, Jane S. „“No Fixed Address”: Elizabeth Banks, the New Woman on Fleet Street“. Victorians: A Journal of Culture and Literature 132, Nr. 1 (2017): 205–13. http://dx.doi.org/10.1353/vct.2017.0018.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

14

Matthopoulos, Panagiotis Petros, und Stella Sofianopoulou. „A firefly algorithm for the heterogeneous fixed fleet vehicle routing problem“. International Journal of Industrial and Systems Engineering 33, Nr. 2 (2019): 204. http://dx.doi.org/10.1504/ijise.2019.102471.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

15

Yousefikhoshbakht, Majid, und Azam Dolatnejad. „A Column Generation for the Heterogeneous Fixed Fleet Open Vehicle Routing Problem“. International Journal of Production Management and Engineering 5, Nr. 2 (28.07.2017): 55. http://dx.doi.org/10.4995/ijpme.2017.5916.

Der volle Inhalt der Quelle

Annotation:

<div><p class="TtuloAbstract">This paper addressed the heterogeneous fixed fleet open vehicle routing problem (HFFOVRP), in which the vehicles are not required to return to the depot after completing a service. In this new problem, the demands of customers are fulfilled by a heterogeneous fixed fleet of vehicles having various capacities, fixed costs and variable costs. This problem is an important variant of the open vehicle routing problem (OVRP) and can cover more practical situations in transportation and logistics. Since this problem belongs to NP-hard Problems, An approach based on column generation (CG) is applied to solve the HFFOVRP. A tight integer programming model is presented and the linear programming relaxation of which is solved by the CG technique. Since there have been no existing benchmarks, this study generated 19 test problems and the results of the proposed CG algorithm is compared to the results of exact algorithm. Computational experience confirms that the proposed algorithm can provide better solutions within a comparatively shorter period of time.</p></div>

APA, Harvard, Vancouver, ISO und andere Zitierweisen

16

Euchi, Jalel, Habib Chabchoub und Adnan Yassine. „New Evolutionary Algorithm Based on 2-Opt Local Search to Solve the Vehicle Routing Problem with Private Fleet and Common Carrier“. International Journal of Applied Metaheuristic Computing 2, Nr. 1 (Januar 2011): 58–82. http://dx.doi.org/10.4018/jamc.2011010105.

Der volle Inhalt der Quelle

Annotation:

Mismanagement of routing and deliveries between sites of the same company or toward external sites leads to consequences in the cost of transport. When shipping alternatives exist, the selection of the appropriate shipping alternative (mode) for each shipment may result in significant cost savings. In this paper, the authors examine a class of vehicle routing in which a fixed internal fleet is available at the warehouse in the presence of an external transporter. The authors describe hybrid Iterated Density Estimation Evolutionary Algorithm with 2-opt local search to determine the specific assignment of each tour to a private vehicle (internal fleet) or an outside carrier (external fleet). Experimental results show that this method is effective, allowing the discovery of new best solutions for well-known benchmarks.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

17

Küçükoğlu, İlker, Dilara Zümbülova, Koray Reyhan, Salih Görgülü und Nursel Öztürk. „A mathematical model for the route optimization of service vehicles“. Global Journal of Business, Economics and Management: Current Issues 7, Nr. 1 (12.04.2017): 152–58. http://dx.doi.org/10.18844/gjbem.v7i1.1410.

Der volle Inhalt der Quelle

Annotation:

The route planning of service vehicles is an important issue for large-scale enterprises which have hundreds of employee. Especially for the flexible shift system which brings about uncertainty for the drivers, the route plans have to be formed daily by the managers. This study addresses the route optimization problem of an automotive company which aims to minimize total transportation cost of the service fleet and proposes a mixed integer mathematical model to solve problem. The objective of the mathematical model is to minimize fixed and transportation cost of the fleet by considering vehicle capacities and travelling time constraints. The mathematical model is tested on a randomly generated problem set which consist of different sized instances for homogeneous service fleet. The computational results obtained by the Gurobi solver show that the proposed mathematical model is capable to find route plans for the real-life service vehicles routing decisions that can minimize total transportation cost of the fleet. Keywords: Vehicle routing, service systems, mathematical modelling;

APA, Harvard, Vancouver, ISO und andere Zitierweisen

18

Tarantilis, C. D., C. T. Kiranoudis und V. S. Vassiliadis. „A threshold accepting metaheuristic for the heterogeneous fixed fleet vehicle routing problem“. European Journal of Operational Research 152, Nr. 1 (Januar 2004): 148–58. http://dx.doi.org/10.1016/s0377-2217(02)00669-0.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

19

Li, Jin, Danping Wang und Jianghua Zhang. „Heterogeneous fixed fleet vehicle routing problem based on fuel and carbon emissions“. Journal of Cleaner Production 201 (November 2018): 896–908. http://dx.doi.org/10.1016/j.jclepro.2018.08.075.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

20

Babaei, Mohsen, Jan-Dirk Schmöcker, Navid Khademi, Ahmad-Reza Ghaffari und Ali Naderan. „Fixed-route taxi system: route network design and fleet size minimization problems“. Journal of Advanced Transportation 50, Nr. 6 (Oktober 2016): 1252–71. http://dx.doi.org/10.1002/atr.1400.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

21

Brandão, José. „A tabu search algorithm for the heterogeneous fixed fleet vehicle routing problem“. Computers & Operations Research 38, Nr. 1 (Januar 2011): 140–51. http://dx.doi.org/10.1016/j.cor.2010.04.008.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

22

Nucamendi-Guillén, Samuel, Alejandra Gómez Padilla, Elias Olivares-Benitez und J. Marcos Moreno-Vega. „The multi-depot open location routing problem with a heterogeneous fixed fleet“. Expert Systems with Applications 165 (März 2021): 113846. http://dx.doi.org/10.1016/j.eswa.2020.113846.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

23

Kirkorova, L. A., T. V. Lipnitskiy, S. Yu Trushchenkova und S. D. Shchetinin. „Fixed Assets of Agriculture: Current State and Trends“. Economy of agricultural and processing enterprises, Nr. 6 (2020): 24–26. http://dx.doi.org/10.31442/0235-2494-2020-0-6-24-26.

Der volle Inhalt der Quelle

Annotation:

The continuity of reproduction of fixed assets is an Integral factor of sustainable growth and stability of the agricultural sector as the most important part of the Russian economy. The reproduction of fixed assets in agriculture is negatively affected by inflation, price disparity, insufficient investment and a number of other negative factors A detailed analysis of the availability and condition of the main types of equipment in the Novgorod region and its availa-bility is performed. Trends in the dynamics of the state of the machine and tractor fleet are re-vealed. As the main direction of improving the situation, the creation of machine-technology sta-tions is proposed.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

24

Asadifard, Elnaz, Maryam Adlifard, Mohammad Taghipour und Nader Shamami. „A A Multi-Objective Mathematical Model for Vehicle Routing Problem Considering the Time Window and Economic and Environmental Objectives Using the Metaheuristic Algorithm Based on Pareto Archive“. Logistics & Supply Chain Review 1, Nr. 1 (18.09.2020): 58–68. http://dx.doi.org/10.38157/logistics-supply-chain-review.v1i1.158.

Der volle Inhalt der Quelle

Annotation:

Purpose: The purpose of this study is the well-known Heterogeneous Fleet Vehicle Routing Problem (HVRP) is one of the developed problems of vehicle routing, which involves optimizing a set of routes for a fleet of vehicles with different costs and capacities. Methods: HVRP is usually modeled as a single objective that aims to minimize overall transportation costs (total fixed costs and costs commensurate with total distance). Results: These vehicles are located in the central depot and serve customers’ demands. Implications: In this case, the number of vehicles available (of any type) may be limited.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

25

Alpaslan Takan, Melis, und Refail Kasimbeyli. „Multiobjective mathematical models and solution approaches for heterogeneous fixed fleet vehicle routing problems“. Journal of Industrial & Management Optimization 13, Nr. 5 (2017): 0. http://dx.doi.org/10.3934/jimo.2020059.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

26

Li, Xiangyong, Peng Tian und Y. P. Aneja. „An adaptive memory programming metaheuristic for the heterogeneous fixed fleet vehicle routing problem“. Transportation Research Part E: Logistics and Transportation Review 46, Nr. 6 (November 2010): 1111–27. http://dx.doi.org/10.1016/j.tre.2010.02.004.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

27

Hoff, Arild, Lars Magnus Hvattum, Ketil Danielsen und Anatol Husakou. „An application of the multi-depot heterogeneous fixed fleet open vehicle routing problem“. International Journal of Advanced Operations Management 12, Nr. 2 (2020): 142. http://dx.doi.org/10.1504/ijaom.2020.10030220.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

28

Husakou, Anatol, Lars Magnus Hvattum, Ketil Danielsen und Arild Hoff. „An application of the multi-depot heterogeneous fixed fleet open vehicle routing problem“. International Journal of Advanced Operations Management 12, Nr. 2 (2020): 142. http://dx.doi.org/10.1504/ijaom.2020.108262.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

29

Euchi, Jalel, und Habib Chabchoub. „A hybrid tabu search to solve the heterogeneous fixed fleet vehicle routing problem“. Logistics Research 2, Nr. 1 (28.04.2010): 3–11. http://dx.doi.org/10.1007/s12159-010-0028-3.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

30

Subramanyam, Anirudh, Panagiotis P. Repoussis und Chrysanthos E. Gounaris. „Robust Optimization of a Broad Class of Heterogeneous Vehicle Routing Problems Under Demand Uncertainty“. INFORMS Journal on Computing 32, Nr. 3 (Juli 2020): 661–81. http://dx.doi.org/10.1287/ijoc.2019.0923.

Der volle Inhalt der Quelle

Annotation:

This paper studies robust variants of an extended model of the classical heterogeneous vehicle routing problem (HVRP), where a mixed fleet of vehicles with different capacities, availabilities, fixed costs, and routing costs is used to serve customers with uncertain demand. This model includes, as special cases, all variants of the HVRP studied in the literature with fixed and unlimited fleet sizes, accessibility restrictions at customer locations, and multiple depots. Contrary to its deterministic counterpart, the goal of the robust HVRP is to determine a minimum cost set of routes and fleet composition that remains feasible for all demand realizations from a prespecified uncertainty set. To solve this problem, we develop robust versions of classical node and edge exchange neighborhoods that are commonly used in local search and establish that efficient evaluation of the local moves can be achieved for five popular classes of uncertainty sets. The proposed local search is then incorporated in a modular fashion within two metaheuristic algorithms to determine robust HVRP solutions. The quality of the metaheuristic solutions is quantified using an integer programming model that provides lower bounds on the optimal solution. An extensive computational study on literature benchmarks shows that the proposed methods allow us to obtain high-quality robust solutions for different uncertainty sets and with minor additional effort compared with deterministic solutions.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

31

Wang, Qian, Qingkai Ji und Chun-Hung Chiu. „Optimal Routing for Heterogeneous Fixed Fleets of Multicompartment Vehicles“. Mathematical Problems in Engineering 2014 (2014): 1–11. http://dx.doi.org/10.1155/2014/847630.

Der volle Inhalt der Quelle

Annotation:

We present a metaheuristic called the reactive guided tabu search (RGTS) to solve the heterogeneous fleet multicompartment vehicle routing problem (MCVRP), where a single vehicle is required for cotransporting multiple customer orders. MCVRP is commonly found in delivery of fashion apparel, petroleum distribution, food distribution, and waste collection. In searching the optimum solution of MCVRP, we need to handle a large amount of local optima in the solution spaces. To overcome this problem, we design three guiding mechanisms in which the search history is used to guide the search. The three mechanisms are experimentally demonstrated to be more efficient than the ones which only apply the known distance information. Armed with the guiding mechanisms and the well-known reactive mechanism, the RGTS can produce remarkable solutions in a reasonable computation time.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

32

Pedroza, Wanderley Nascimento, und Dércio Luiz Reis. „Implementation of a Costing System in the Fleet Management of a Brazilian Public University“. International Journal for Innovation Education and Research 9, Nr. 2 (01.02.2021): 64–85. http://dx.doi.org/10.31686/ijier.vol9.iss2.2947.

Der volle Inhalt der Quelle

Annotation:

This work presents the implementation of a costing system in Fleet Management at a Brazilian Public University, applying concepts of cost accounting, engineering, indexes, and maintenance management, as well as using the cost absorption method. As a methodology, an action research is applied to meet the objectives of being exploratory and descriptive; about the nature of the research, and applied research is adopted through a case study procedure in a Transport Coordination. To prepare for this work, the operational data of the fleet were collected during 12 months in the different units and internal control systems. The results of the study showed the operating costs of the fleet such as total fuel spent annually, totally spent on maintenance, as well as their respective indices, cost per kilometer, fixed and variable costs sufficient for accountability with the Official Bodies of Control. It was noted that the study applied in this work provided a basis for implementing a Costing System for fleet management of a Brazilian public university, respecting the guidelines of Normative Instruction No. 3, of May 15, 2008, which deals with the use and accountability, even fully complied with the requirements of the regulations regarding the Performance Control and Maintenance Maps of the Official Vehicle in an individualized manner, providing information on operational costing of the fleet sufficient for the decisions of the managers of the Public Institution.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

33

Yousefikhoshbakht, Majid, Azam Dolatnejad, Farzad Didehvar und Farhad Rahmati. „A Modified Column Generation to Solve the Heterogeneous Fixed Fleet Open Vehicle Routing Problem“. Journal of Engineering 2016 (2016): 1–12. http://dx.doi.org/10.1155/2016/5692792.

Der volle Inhalt der Quelle

Annotation:

In the heterogeneous fixed fleet open vehicle routing problem (HFFOVRP), several different types of vehicles can be used to service the customers. The types of vehicles are different in terms of capacity, fixed cost, and variable cost. In this problem, the vehicles are not required to return to the depot after completing a service and the number of vehicles of each type is fixed and limited. Since this problem belongs to NP-hard problems, in this paper a compound heuristic algorithm called SISEC which includes sweep algorithm, insert, swap, and 2-opt moves, modified elite ant system (EAS), and column generation (CG) is applied to solve the HFFOVRP. We report computational results on 22 problems and solve each problem by using our SISEC. The results which were compared to the results of exact algorithms and the classic CG confirm that the proposed algorithm produces high quality solutions within an acceptable computation time.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

34

Lan, Zekang, Shiwei He, Rui Song und Sijia Hao. „Optimizing Vehicle Scheduling Based on Variable Timetable by Benders-and-Price Approach“. Journal of Advanced Transportation 2019 (06.01.2019): 1–13. http://dx.doi.org/10.1155/2019/2781590.

Der volle Inhalt der Quelle

Annotation:

In practice, vehicle scheduling is planned on a variable timetable so that the departure times of trips can be shifted in tolerable ranges, rather than on a fixed timetable, to decrease the required fleet size. This paper investigates the vehicle scheduling problem on a variable timetable with the constraint that each vehicle can perform limited trips. Since the connection-based model is difficult to solve by optimization software for a medium-scale or large-scale instance, a designed path-based model is developed. A Benders-and-Price algorithm by combining the Benders decomposition and column generation is proposed to solve the LP-relaxation of the path-based model, and a bespoke Branch-and-Price is used to obtain the integer solution. Numerical experiments indicate that a variable timetable approach can reduce the required fleet size with a tolerable timetable deviation in comparison with a fixed timetable approach. Moreover, the proposed algorithm is greatly superior to GUROBI in terms of computational efficiency and guarantees the quality of the solution.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

35

Tarantilis, C. D., C. T. Kiranoudis und V. S. Vassiliadis. „A list based threshold accepting metaheuristic for the heterogeneous fixed fleet vehicle routing problem“. Journal of the Operational Research Society 54, Nr. 1 (Januar 2003): 65–71. http://dx.doi.org/10.1057/palgrave.jors.2601443.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

36

Matei, Oliviu, Petrică C. Pop, Jozsef Laszlo Sas und Camelia Chira. „An improved immigration memetic algorithm for solving the heterogeneous fixed fleet vehicle routing problem“. Neurocomputing 150 (Februar 2015): 58–66. http://dx.doi.org/10.1016/j.neucom.2014.02.074.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

37

Kochetov, Yu A., und A. V. Khmelev. „A hybrid algorithm of local search for the heterogeneous fixed fleet vehicle routing problem“. Journal of Applied and Industrial Mathematics 9, Nr. 4 (Oktober 2015): 503–18. http://dx.doi.org/10.1134/s1990478915040079.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

38

Baldacci, Roberto, Maria Battarra und Daniele Vigo. „Valid inequalities for the fleet size and mix vehicle routing problem with fixed costs“. Networks 54, Nr. 4 (11.08.2009): 178–89. http://dx.doi.org/10.1002/net.20331.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

39

Yousefikhoshbakht, Majid, Farzad Didehvar und Farhad Rahmati. „Solving the heterogeneous fixed fleet open vehicle routing problem by a combined metaheuristic algorithm“. International Journal of Production Research 52, Nr. 9 (14.11.2013): 2565–75. http://dx.doi.org/10.1080/00207543.2013.855337.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

40

Gencer, Cevriye, İsmail Top und Emel Kizilkaya Aydogan. „A new intuitional algorithm for solving heterogeneous fixed fleet routing problems: Passenger pickup algorithm“. Applied Mathematics and Computation 181, Nr. 2 (Oktober 2006): 1552–67. http://dx.doi.org/10.1016/j.amc.2006.02.043.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

41

Wang, Sung-Jung, und S. K. Jason Chang. „Autonomous Bus Fleet Control Using Multiagent Reinforcement Learning“. Journal of Advanced Transportation 2021 (02.07.2021): 1–14. http://dx.doi.org/10.1155/2021/6654254.

Der volle Inhalt der Quelle

Annotation:

Autonomous buses are becoming increasingly popular and have been widely developed in many countries. However, autonomous buses must learn to navigate the city efficiently to be integrated into public transport systems. Efficient operation of these buses can be achieved by intelligent agents through reinforcement learning. In this study, we investigate the autonomous bus fleet control problem, which appears noisy to the agents owing to random arrivals and incomplete observation of the environment. We propose a multi-agent reinforcement learning method combined with an advanced policy gradient algorithm for this large-scale dynamic optimization problem. An agent-based simulation platform was developed to model the dynamic system of a fixed stop/station loop route, autonomous bus fleet, and passengers. This platform was also applied to assess the performance of the proposed algorithm. The experimental results indicate that the developed algorithm outperforms other reinforcement learning methods in the multi-agent domain. The simulation results also reveal the effectiveness of our proposed algorithm in outperforming the existing scheduled bus system in terms of the bus fleet size and passenger wait times for bus routes with comparatively lesser number of passengers.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

42

Čokorilo, Olja, Slobodan Gvozdenović, Petar Mirosavljević und Ljubiša Vasov. „MULTI ATTRIBUTE DECISION MAKING: ASSESSING THE TECHNOLOGICAL AND OPERATIONAL PARAMETERS OF AN AIRCRAFT“. TRANSPORT 25, Nr. 4 (31.12.2010): 352–56. http://dx.doi.org/10.3846/transport.2010.43.

Der volle Inhalt der Quelle

Annotation:

Regional aircraft are playing a significant role in airline operations. This paper considers the problem of selecting an appropriate aircraft from the airline fleet for optimal regional air travel realization. Complexity balance between air travel demand (passengers, goods) and the proposed aircraft capacity presents the priority in airline operations. A principal feature of the methodology considered in this paper is a multi attribute analysis of technological and operational aircraft characteristics (turboprop and turbojet). A comparison of the presented regional aircraft parameters is based on the following criteria: technological (aerodynamic efficiency, structural efficiency, fuel flow at the optional FL, cruise endurance and requested trip fuel for the fixed cruise range), operational (max range with max payload, ground efficiency (aircraft maintainability based on external dimensions) and climb capability. With the aim of defining aircraft rank, the TOPSIS (Technique for Order Preference by Similarity to Ideal Solution) method was applied. Therefore, the Saaty scale was used for developing the weight of different criteria. The conducted research included a sample of four representative regional aircraft: Do328, CRJ100er, Saab2000 and ERJ145. The results obtained would help in determining the airline fleet or selecting the optional solution from the existing fleet.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

43

Fachini, Ramon Faganello, und Vinícius Amaral Armentano. „Logic-based Benders decomposition for the heterogeneous fixed fleet vehicle routing problem with time windows“. Computers & Industrial Engineering 148 (Oktober 2020): 106641. http://dx.doi.org/10.1016/j.cie.2020.106641.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

44

Khasnabis, Snehamay, Joseph Bartus und Richard Darin Ellis. „Asset Management Framework for State Departments of Transportation to Meet Transit Fleet Requirements“. Transportation Research Record: Journal of the Transportation Research Board 1835, Nr. 1 (Januar 2003): 74–83. http://dx.doi.org/10.3141/1835-10.

Der volle Inhalt der Quelle

Annotation:

State departments of transportation that provide the bulk of matching funds to local transit agencies for the purchase of new buses are duly concerned about the escalating costs of new buses and the lack of sufficient funds to keep up with their replacement costs. An asset management framework is presented that can be used by state departments of transportation to ( a) allocate capital dollars for the dual purpose of purchasing new buses and rebuilding existing buses within the constraints of a fixed budget when the needs of all constituent agencies in a peer group are considered and ( b) distribute funds among the agencies equitably. The proposed framework includes two optimization models. Model 1 attempts to maximize the weighted fleet life of all the buses being purchased and rebuilt for a given peer group within the constraints of a fixed budget. Model 2 is designed to maximize the remaining life of the entire peer group, including the existing buses and those being replaced or rebuilt. Case studies presented to demonstrate the application of the models show that the framework is viable and can be used for the designated purpose with fleet data currently available from transit agencies. Further research on testing the framework is recommended to ensure its applicability under different sets of circumstances.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

45

Ceder, Avishai (Avi). „Estimation of Fleet Size for Variable Bus Schedules“. Transportation Research Record: Journal of the Transportation Research Board 1903, Nr. 1 (Januar 2005): 2–10. http://dx.doi.org/10.1177/0361198105190300101.

Der volle Inhalt der Quelle

Annotation:

A highly informative graphical technique addresses the problem of finding the lower bound of the number of buses required to service a given timetable of trips. The technique is based on a step function that has been applied over the past 20 years as an optimization tool for minimizing the number of vehicles in a fixed trip schedule. The step function is called deficit function (DF), for it represents the deficit number of vehicles required at a particular terminal in a multiterminal transit system. The initial lower bound on the fleet size with deadheading (DH) (empty) trip insertions was found to be the maximum of the sum of all DFs. An improved lower bound was established later; it was based on extending each trip's arrival time to the time of the first feasible departure time of a trip to which it may be linked or to the end of the finite time horizon. The present work continues the effort to calculate and improve the lower bound by considering variable departure times along with possible insertions of DH trips. Certainly, the use of shifting departure times opens up more opportunities to reduce bus fleet size than does allowing only for DH trip insertions. This work shows how to apply possible shifts in departure times, within their tolerances, to improving the lower bound. The approach presented will enable bus schedulers and transit decision makers to decide more promptly how far the fleet size can be reduced by DH trip insertions and allowing shifts in departure times.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

46

Eigaard, Ole Ritzau. „A bottom-up approach to technological development and its management implications in a commercial fishery“. ICES Journal of Marine Science 66, Nr. 5 (08.04.2009): 916–27. http://dx.doi.org/10.1093/icesjms/fsp084.

Der volle Inhalt der Quelle

Annotation:

Abstract Eigaard, O. R. 2009. A bottom-up approach to technological development and its management implications in a commercial fishery. – ICES Journal of Marine Science, 66: 916–927. Analyses of electronic equipment on board Danish trawlers and gillnetters show that newer, larger vessels have a significantly higher “technological level” than older, smaller vessels. A hypothesis of linkage between fish-finding and navigation technology on board and standard vessel characteristics was tested based on the definition of a technological index. Using a proportional odds model, vessel length accounted for most of the variation in technological level on board, with odds of 1.17 (95% confidence interval: 1.16–1.18) of a higher index value for each increase in vessel length of 1 m. Vessel age was also significantly correlated with index values. In considering the technological index as an indicator of fishing power, the results have important implications for capacity-reduction schemes intended to reduce harvest pressure on fish stocks. In the course of such structural management plans, older, smaller vessels of a fleet are often replaced with newer, larger vessels within a fixed or reduced nominal capacity limit (e.g. total fleet tonnage), but according to the findings presented, nominal capacity reduction in fleet level may be undermined by increases in individual vessel fishing power.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

47

Shuai Zhai und Chao Mao. „Model and Heuristics for the Heterogeneous Fixed Fleet Vehicle Routing Problem with Pick-Up and Delivery“. Journal of Distribution Science 10, Nr. 12 (Dezember 2012): 19–24. http://dx.doi.org/10.15722/jds.10.12.201212.19.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

48

Tütüncü, G. Yazgı. „An interactive GRAMPS algorithm for the heterogeneous fixed fleet vehicle routing problem with and without backhauls“. European Journal of Operational Research 201, Nr. 2 (März 2010): 593–600. http://dx.doi.org/10.1016/j.ejor.2009.03.044.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

49

Baller, Annelieke C., Said Dabia, Wout E. H. Dullaert und Daniele Vigo. „The Vehicle Routing Problem with Partial Outsourcing“. Transportation Science 54, Nr. 4 (Juli 2020): 1034–52. http://dx.doi.org/10.1287/trsc.2019.0940.

Der volle Inhalt der Quelle

Annotation:

This paper introduces the vehicle routing problem with partial outsourcing (VRPPO) in which a customer can be served by a single private vehicle, by a common carrier, or by both a single private vehicle and a common carrier. As such, it is a variant of the vehicle routing problem with private fleet and common carrier (VRPPC). The objective of the VRPPO is to minimize fixed and variable costs of the private fleet plus the outsourcing cost. We propose two different path-based formulations for the VRPPO and solve these with a branch-and-price-and-cut solution method. For each path-based formulation, two different pricing procedures are designed and used when solving the linear relaxations by column generation. To assess the quality of the solution methods and gain insight in potential cost improvements compared with the VRPPC, we perform tests on two instance sets with up to 100 customers from the literature.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

50

Rizzi, Stephen, und Menachem Rafaelof. „Community noise assessment of urban air mobility vehicle operations using the FAA Aviation Environmental Design Tool“. INTER-NOISE and NOISE-CON Congress and Conference Proceedings 263, Nr. 6 (01.08.2021): 450–61. http://dx.doi.org/10.3397/in-2021-1482.

Der volle Inhalt der Quelle

Annotation:

In contrast to most commercial air traffic today, vehicles serving the urban air mobility (UAM) market are anticipated to operate in communities close to the public at large. The approved model for assessing environmental impact of air traffic actions in the United States, the Federal Aviation Administration's Aviation Environmental Design Tool (AEDT), does not support analysis of such operations due to a combined lack of a UAM aircraft performance model and aircraft noise data. This paper discusses the initial development of a method to assess the acoustic impact of UAM fleet operations on the community using AEDT and demonstrates its use for representative UAM operations. In particular, methods were developed using fixed-point flight profiles and user-supplied noise data in a manner that avoids unwanted behavior in AEDT. A set of 32 routes in the Dallas-Ft. Worth area were assessed for single and multiple (fleet) operations for two concept vehicles.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Wir bieten Rabatte auf alle Premium-Pläne für Autoren, deren Werke in thematische Literatursammlungen aufgenommen wurden. Kontaktieren Sie uns, um einen einzigartigen Promo-Code zu erhalten!