Gotowa bibliografia na temat „Routing with profits”
Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych
Spis treści
Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „Routing with profits”.
Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.
Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.
Artykuły w czasopismach na temat "Routing with profits"
Li, Jian, i Wenhua Lu. "Full truckload vehicle routing problem with profits". Journal of Traffic and Transportation Engineering (English Edition) 1, nr 2 (kwiecień 2014): 146–52. http://dx.doi.org/10.1016/s2095-7564(15)30099-4.
Pełny tekst źródłaLi, Jianping, Kang Li, Lusheng Wang i Hao Zhao. "Maximizing Profits of Routing in WDM Networks". Journal of Combinatorial Optimization 10, nr 2 (wrzesień 2005): 99–111. http://dx.doi.org/10.1007/s10878-005-2263-0.
Pełny tekst źródłaArchetti, C., N. Bianchessi i M. G. Speranza. "Optimal solutions for routing problems with profits". Discrete Applied Mathematics 161, nr 4-5 (marzec 2013): 547–57. http://dx.doi.org/10.1016/j.dam.2011.12.021.
Pełny tekst źródłaArchetti, Claudia, Luca Bertazzi, Demetrio Laganà i Francesca Vocaturo. "The Undirected Capacitated General Routing Problem with Profits". European Journal of Operational Research 257, nr 3 (marzec 2017): 822–33. http://dx.doi.org/10.1016/j.ejor.2016.08.001.
Pełny tekst źródłaArchetti, Claudia, Dominique Feillet, Alain Hertz i M. Grazia Speranza. "The undirected capacitated arc routing problem with profits". Computers & Operations Research 37, nr 11 (listopad 2010): 1860–69. http://dx.doi.org/10.1016/j.cor.2009.05.005.
Pełny tekst źródłaStavropoulou, F., P. P. Repoussis i C. D. Tarantilis. "The Vehicle Routing Problem with Profits and consistency constraints". European Journal of Operational Research 274, nr 1 (kwiecień 2019): 340–56. http://dx.doi.org/10.1016/j.ejor.2018.09.046.
Pełny tekst źródłaLee, Dongoo, i Jaemyung Ahn. "Vehicle routing problem with vector profits with max-min criterion". Engineering Optimization 51, nr 2 (24.04.2018): 352–67. http://dx.doi.org/10.1080/0305215x.2018.1458845.
Pełny tekst źródłaZachariadis, E. E., i C. T. Kiranoudis. "Local search for the undirected capacitated arc routing problem with profits". European Journal of Operational Research 210, nr 2 (kwiecień 2011): 358–67. http://dx.doi.org/10.1016/j.ejor.2010.09.039.
Pełny tekst źródłaArchetti, Claudia, Nicola Bianchessi, M. Grazia Speranza i Alain Hertz. "Incomplete service and split deliveries in a routing problem with profits". Networks 63, nr 2 (3.10.2013): 135–45. http://dx.doi.org/10.1002/net.21529.
Pełny tekst źródłaPoltavskaya, Yuliya. "ROUTING CARGO TRAFFIC IN MULTIMODAL TRANSPORT NETWORKS". Modern Technologies and Scientific and Technological Progress 2022, nr 1 (16.05.2022): 195–96. http://dx.doi.org/10.36629/2686-9896-2022-1-195-196.
Pełny tekst źródłaRozprawy doktorskie na temat "Routing with profits"
El-Hajj, Racha. "Vehicle routing problems with profits, exact and heuristic approaches". Thesis, Compiègne, 2015. http://www.theses.fr/2015COMP2192.
Pełny tekst źródłaWe focus in this thesis on developing new algorithms to solve the Team Orienteering Problem (TOP) and two of its variants. This problem derives from the well-known vehicle routing problem by imposing some resource limitations .We propose an exact method based on Mixed Integer Linear Programming (MILP) to solve this problem by adding valid inequalities to speed up its solution process. Then, by considering strict working periods for each vehicle during its route, we treat one of the variants of TOP, which is the multi-period TOP (mTOP) for which we develop a metaheuristic based on the particle swarm optimization approach to solve it. An optimal split procedure is proposed to extract the optimal solution from each particle by considering saturated and pseudo-saturated routes. Finally, in order to take into consideration the availability of customers, a time window is associated with each of them, during which they must be served. The resulting variant is the TOP with Time Windows (TOPTW). Two exact algorithms are proposed to solve this problem. The first algorithm is based on column generation approach and the second one on the MILP to which we add additional cuts specific for this problem. The comparison between our exact and heuristic methods with the existing one in the literature shows the effectiveness of our approaches
Ahn, Jaemyung. "The Generalized Location Routing Problem with Profits for planetary surface exploration and terrestrial applications". Thesis, Massachusetts Institute of Technology, 2008. http://hdl.handle.net/1721.1/43077.
Pełny tekst źródłaIncludes bibliographical references (p. 143-149).
As the scale of space exploration gets larger, planning of planetary surface exploration becomes more complex and campaign-level optimization becomes necessary. This is a challenging profit maximization problem whose decisions encompass selection of bases, technological options, routes, and excursion methods under constraints on a route, a mission, and a whole campaign. The Generalized Location Routing Problem with Profits (GLRPP) is developed in this thesis as a framework to solve this campaign optimization problem. A mathematical formulation for the GLRPP is developed and two solution methods to solve the GLRPP - a single phase method and a three-phase method - are presented. Numerical experiments for these two solution methods are carried out and their performance in terms of efficiency and effectiveness are analyzed. Two case studies are carried out. The first case study is a global Mars surface exploration campaign optimization. Problem instances for 100 potential bases and 1000 potential exploration sites are successfully solved using a three-phase solution method. A methodology to express the incremental value of a technology using exploration profits is demonstrated to evaluate an orbiting depot and in-situ resource utilization (ISRU). The second case study is a college football recruiting problem. A GLRPP instance is created out of the NCAA football division I-A schools and airports from which the schools can be reached. The problem is successfully solved using the three-phase solution method within a very small optimality gap.
by Jaemyung Ahn.
Ph.D.
Polat, Esra. "A Location And Routing-with-profit Problem In Glass Recycling". Master's thesis, METU, 2008. http://etd.lib.metu.edu.tr/upload/12610221/index.pdf.
Pełny tekst źródłaTran, Trong Hieu. "Méthodes d'optimisation hybrides pour des problèmes de routages avec profits". Electronic Thesis or Diss., Toulouse 3, 2023. http://www.theses.fr/2023TOU30367.
Pełny tekst źródłaCombinatorial optimization is an essential branch of computer science and mathematical optimization that deals with problems involving a discrete and finite set of decision variables. In such problems, the main objective is to find an assignment that satisfies a set of specific constraints and optimizes a given objective function. One of the main challenges is that these problems can be hard to solve in practice. In many cases, incomplete methods are preferred to complete methods since the latter may have difficulties in solving large-scale problems within a limited amount of time. On the other hand, incomplete methods can quickly produce high-quality solutions, which is a critical point in numerous applications. In this thesis, we investigate hybrid approaches that enhance incomplete search by exploiting complete search techniques. For this, we deal with a concrete case study, which is the vehicle routing problem with profits. In particular, we aim to boost incomplete search algorithms by extracting some knowledge during the search process and reasoning with the knowledge acquired in the past. The core idea is two-fold: (i) to learn conflicting solutions (that violate some constraints or that are suboptimal) and exploit them to avoid reconsidering the same solutions and guide search, and (ii) to exploit good features of elite solutions in order to hopefully generate new solutions having a higher quality. Furthermore, we investigate the development of a generic framework by decomposing and exchanging information between sub-modules to efficiently solve complex routing problems possibly involving optional customers, multiple vehicles, multiple time windows, multiple side constraints, and/or time-dependent transition times. The effectiveness of the approaches proposed is shown by various experiments on both standard benchmarks (e.g., the Orienteering Problem and its variants) and real-life datasets from the aerospace domain (e.g., the Earth Observation Satellite scheduling problem), and possibly involving uncertain profits
Vicente, Tiago da Luz. "Otimização das rotas para operadores de coleta da EMEL". Master's thesis, Instituto Superior de Economia e Gestão, 2016. http://hdl.handle.net/10400.5/13694.
Pełny tekst źródłaAtravés da parceria entre o ISEG e a EMEL - Empresa Municipal de Mobilidade e Estacionamento de Lisboa, foi realizado um estágio profissional, tendo como objetivo otimizar as rotas dos operadores de coleta da EMEL. Foi assim definido o objetivo de identificar, de forma automática, rotas que permitam coletar mais dinheiro no fim de cada turno, reduzindo e homogeneizando os montantes de dinheiro que ficam na rua e, por consequência, o risco de roubo. O problema enquadrado no Vehicle Routing Problem with Profits, identifica rotas que, partindo e regressando de/a um ponto fixo (a base), visitam um certo conjunto de nodos (parquímetros), compatíveis com a capacidade do veículo e com a duração dos turnos dos operadores de coleta. Não se exige que todos os nodos sejam visitados diariamente, sendo apenas visitados os que garantem maior retorno. Foi construída uma função para estimar o valor depositado em cada parquímetro, por hora, sendo assim possível estimar o seu valor no momento da coleta. De seguida, desenvolveu-se e programou-se (em VBA) uma heurística construtiva para a geração de rotas.
Through the partnership between ISEG and EMEL - Empresa Municipal de Mobilidade e Estacionamento de Lisboa, the traineeship has been proposed aiming to optimize the routes made by the EMEL's coin collection operators. The scope is to automatically identify routes that allow the coin collection of more parking meters at the end of each working shift, reducing the amount of money left on the street. The problem was interpreted as a Vehicle Routing Problem with Profits. The routes start and end at a fixed point (the base), and the vehicles must visit a certain set of nodes (metered), within the crew time limit. In this problem there is no need to visit every node daily but to visit those that guarantee a higher return, provided that both the vehicles' capacity and the time limits are satisfied. A valuation function was built to estimate the value deposited in each parking meter per hour. Then, a constructive heuristic was developed and programmed (VBA) to generate routes.
info:eu-repo/semantics/publishedVersion
Melconian, Terran (Terran Kirk) 1979. "Effects of increased nonstop routing on airline cost and profit". Thesis, Massachusetts Institute of Technology, 2001. http://hdl.handle.net/1721.1/16831.
Pełny tekst źródłaIncludes bibliographical references (p. 77-78).
This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
by Terran Melconian.
S.M.
Hemmelmayr, Vera, Karen Smilowitz i la Torre Luis de. "A Periodic Location Routing Problem for Collaborative Recycling". Taylor & Francis, 2017. http://dx.doi.org/10.1080/24725854.2016.1267882.
Pełny tekst źródłaHOMSI, GABRIEL ANDRE. "SHIP ROUTING AND SPEED OPTIMIZATION WITH HETEROGENEOUS FUEL CONSUMPTION PROFILES". PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2018. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=34172@1.
Pełny tekst źródłaCOORDENAÇÃO DE APERFEIÇOAMENTO DO PESSOAL DE ENSINO SUPERIOR
CONSELHO NACIONAL DE DESENVOLVIMENTO CIENTÍFICO E TECNOLÓGICO
PROGRAMA DE EXCELENCIA ACADEMICA
A indústria de transporte marítimo é essencial para o comércio internacional. No entanto, no despertar da crise financeira de 2008, essa indústria foi severamente atingida. Nessas ocasiões, empresas de transporte só são capazes de obter lucro se suas frotas forem roteadas de forma eficaz. Neste trabalho, nós estudamos uma classe de problemas de roteamento de navios relacionados ao Pickup and Delivery Problem with Time Windows. Para resolver esses problemas, nós introduzimos um método heurístico e um exato. O método heurístico é uma meta-heurística híbrida com uma vizinhança larga baseada em set partitioning, enquanto o método exato é um algoritmo de branch-and-price. Nós conduzimos experimentos em um conjunto de instâncias baseadas em rotas de navios reais. Os resultados obtidos mostram que nossos algoritmos superam as metodologias estado da arte. Em seguida, nós adaptamos o conjunto de instâncias para modelar um problema de roteamento de navios no qual a velocidade em cada segmento de rota é uma variável de decisão, e o consumo de combustível por unidade de tempo é uma função convexa da velocidade e carga do navio. A fim de resolver esse novo problema de roteamento de navios com otimização de velocidade, nós estendemos nossa meta-heurística para encontrar decisões de velocidade ótimas em toda avaliação de solução vizinha de uma busca local. Nossos experimentos demonstram que essa abordagem pode ser altamente rentável, e que requer apenas um aumento moderado de recursos computacionais.
The shipping industry is essential for international trade. However, in the wake of the 2008 financial crisis, this industry was severely hit. In these times, transportation companies can only obtain profit if their fleet is routed effectively. In this work, we study a class of ship routing problems related to the Pickup and Delivery Problem with Time Windows. To solve these problems, we introduce a heuristic and an exact method. The heuristic method is a hybrid metaheuristic with a set-partitioning-based large neighborhood, while the exact method is a branch-and-price algorithm. We conduct experiments on a benchmark suite based on real-life shipping segments. The results obtained show that our algorithms largely outperform the state-of-the-art methodologies. Next, we adapt the benchmark suite to model a ship routing problem where the speed on each sailing leg is a decision variable, and fuel consumption per time unit is a convex function of the ship speed and payload. To solve this new ship routing problem with speed optimization, we extend our metaheuristic to find optimal speed decisions on every local search move evaluation. Our computational experiments demonstrate that such approach can be highly profitable, with only a moderate increase in computational effort.
Kashyap, Abhishek. "Profile based topology control and routing in wireless optical networks". College Park, Md. : University of Maryland, 2004. http://hdl.handle.net/1903/1440.
Pełny tekst źródłaThesis research directed by: Dept. of Electrical and Computer Engineering. Title from t.p. of PDF. Includes bibliographical references. Published by UMI Dissertation Services, Ann Arbor, Mich. Also available in paper.
Schreier, Hannah Milena Caroline. "Longitudinal relationships between family routines and biological profiles in youth with asthma". Thesis, University of British Columbia, 2008. http://hdl.handle.net/2429/1409.
Pełny tekst źródłaKsiążki na temat "Routing with profits"
Sotamaa, Olli, i Jan Svelch, red. Game Production Studies. NL Amsterdam: Amsterdam University Press, 2021. http://dx.doi.org/10.5117/9789463725439.
Pełny tekst źródłaVansteenwegen, Pieter, i Aldy Gunawan. Orienteering Problems: Models and Algorithms for Vehicle Routing Problems with Profits. Springer International Publishing AG, 2020.
Znajdź pełny tekst źródłaVansteenwegen, Pieter, i Aldy Gunawan. Orienteering Problems: Models and Algorithms for Vehicle Routing Problems with Profits. Springer, 2019.
Znajdź pełny tekst źródłaCavanna, Andrea E. Vigabatrin. Oxford University Press, 2018. http://dx.doi.org/10.1093/med/9780198791577.003.0015.
Pełny tekst źródłaL, Anderson William. Swing Trading: A Beginner's Guide with Proven Strategies on How to Trade with Options, Stocks, Futures and Make Profits Fast. Tools, Time and Money Management, Rules and Routine of a Trader. Independently Published, 2019.
Znajdź pełny tekst źródłaMainwaring, Lynda. Psychological Factors and Sport-Related Concussion. Redaktorzy Ruben Echemendia i Grant L. Iverson. Oxford University Press, 2017. http://dx.doi.org/10.1093/oxfordhb/9780199896585.013.15.
Pełny tekst źródłaJalan, Rajiv, i Banwari Agarwal. Extracorporeal liver support devices in the ICU. Oxford University Press, 2016. http://dx.doi.org/10.1093/med/9780199600830.003.0198.
Pełny tekst źródłaRich, Andrew. Swing Trading: Strategies and Guide for Beginners. Different Options for Risk Management and Analysis. Easy Rules and Routines Used When Investing in Stocks or Forex Which Lead to Dividend Profits. Independently Published, 2019.
Znajdź pełny tekst źródłaSwing, Matthew J. Swing Trading: A Comprehensive Guide for Beginners on How to Make High Profits with Little Time Available. Learn Base Rules, Routines and the Pros&Cons about Trading on Stocks, Options, Forex and ETF. Independently Published, 2019.
Znajdź pełny tekst źródłaKontos, Louis, i David C. Brotherton, red. Encyclopedia of Gangs. Greenwood Publishing Group, Inc., 2007. http://dx.doi.org/10.5040/9798400655593.
Pełny tekst źródłaCzęści książek na temat "Routing with profits"
Archetti, Claudia, M. Grazia Speranza i Daniele Vigo. "Chapter 10: Vehicle Routing Problems with Profits". W Vehicle Routing, 273–97. Philadelphia, PA: Society for Industrial and Applied Mathematics, 2014. http://dx.doi.org/10.1137/1.9781611973594.ch10.
Pełny tekst źródłaArchetti, Claudia, i M. Grazia Speranza. "Chapter 12: Arc Routing Problems with Profits". W Arc Routing, 281–99. Philadelphia, PA: Society for Industrial and Applied Mathematics, 2015. http://dx.doi.org/10.1137/1.9781611973679.ch12.
Pełny tekst źródłaBruni, M. E., S. Nucamendi-Guillén, S. Khodaparasti i P. Beraldi. "The Cumulative Capacitated Vehicle Routing Problem with Profits Under Uncertainty". W AIRO Springer Series, 311–22. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-34960-8_28.
Pełny tekst źródłaVansteenwegen, Pieter, i Aldy Gunawan. "Definitions and Mathematical Models of Single Vehicle Routing Problems with Profits". W EURO Advanced Tutorials on Operational Research, 7–19. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-29746-6_2.
Pełny tekst źródłaOgino, Nagao, i Masatoshi Suzuki. "Proposal of an Inter-AS Policy Routing and a Flow Pricing Scheme to Improve ASes’ Profits". W Networking — ICN 2001, 673–86. Berlin, Heidelberg: Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-47728-4_66.
Pełny tekst źródłaFarmer, Jane, Anthony McCosker, Kath Albury i Amir Aryani. "Introduction". W Data for Social Good, 1–26. Singapore: Springer Nature Singapore, 2022. http://dx.doi.org/10.1007/978-981-19-5554-9_1.
Pełny tekst źródłaSchönfelder, René, Martin Leucker i Sebastian Walther. "Efficient Profile Routing for Electric Vehicles". W Lecture Notes in Computer Science, 21–30. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-11167-4_3.
Pełny tekst źródłaXie, Yubin, Zizhen Zhang, Hu Qin, Songshan Guo i Andrew Lim. "The Multi-period Profit Collection Vehicle Routing Problem with Time Windows". W Modern Advances in Applied Intelligence, 466–75. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-07467-2_49.
Pełny tekst źródłaBratu, Roxana. "Friday Lunch with EU Funding: Profit-Making Routines". W Corruption, Informality and Entrepreneurship in Romania, 201–24. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-66667-9_7.
Pełny tekst źródłaSuri, Subhash, Marcel Waldvogel i Priyank Ramesh Warkhede. "Profile-Based Routing: A New Framework for MPLS Traffic Engineering". W Quality of Future Internet Services, 138–57. Berlin, Heidelberg: Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-45412-8_11.
Pełny tekst źródłaStreszczenia konferencji na temat "Routing with profits"
Li, Jian, i Wenhua Lu. "Full Truckload Vehicle Routing Problem with Profits". W 14th COTA International Conference of Transportation Professionals. Reston, VA: American Society of Civil Engineers, 2014. http://dx.doi.org/10.1061/9780784413623.083.
Pełny tekst źródłaViktorin, Adam, Dusan Hrabec i Michal Pluhacek. "Multi-Chaotic Differential Evolution For Vehicle Routing Problem With Profits". W 30th Conference on Modelling and Simulation. ECMS, 2016. http://dx.doi.org/10.7148/2016-0245.
Pełny tekst źródłaAleksandrov, Martin Damyanov. "Fair Division meets Vehicle Routing: Fairness for Drivers with Monotone Profits". W 2022 IEEE Intelligent Vehicles Symposium (IV). IEEE, 2022. http://dx.doi.org/10.1109/iv51971.2022.9827432.
Pełny tekst źródłaSánchez, Aitor López, Marin Lujak, Frederic Semet i Holger Billhardt. "Vehicle Routing Problem with Fair Profits and Time Windows (VRP-FPTW)". W 2023 IEEE International Conference on Systems, Man, and Cybernetics (SMC). IEEE, 2023. http://dx.doi.org/10.1109/smc53992.2023.10394012.
Pełny tekst źródłaWidyandaru, Rahadyas Bharata, Niniet Indah Arvitrida i Ahmad Rusdiansyah. "Integrated Location and Technician Routing Problem with Profits and Time Windows for Supporting Maintenance Activities of Technology Infrastructure". W 3rd African International Conference on Industrial Engineering and Operations Management. Michigan, USA: IEOM Society International, 2022. http://dx.doi.org/10.46254/af03.20220211.
Pełny tekst źródłaMao, Wengang, Zhiyuan Li, Jonas W. Ringsberg i Igor Rychlik. "Fatigue Variation in Ships due to the Variability of Environmental Loads". W ASME 2012 31st International Conference on Ocean, Offshore and Arctic Engineering. American Society of Mechanical Engineers, 2012. http://dx.doi.org/10.1115/omae2012-83293.
Pełny tekst źródłaCardona Restrepo, J. C., C. G. Gruber i C. Mas Machuca. "Energy Profile Aware Routing". W 2009 IEEE International Conference on Communications Workshops. IEEE, 2009. http://dx.doi.org/10.1109/iccw.2009.5208041.
Pełny tekst źródłaZaitseva, A., L. M. Hvattum i S. Urrutia. "Profit Maximization in Inventory Routing Problems". W 2018 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM). IEEE, 2018. http://dx.doi.org/10.1109/ieem.2018.8607713.
Pełny tekst źródłaLi, Zhiyao, Jiale Zhang, Xiaofeng Gao i Guihai Chen. "Maximum Profit Routing for Mobile Crowdsensing". W 2022 21st ACM/IEEE International Conference on Information Processing in Sensor Networks (IPSN). IEEE, 2022. http://dx.doi.org/10.1109/ipsn54338.2022.00042.
Pełny tekst źródłaRogers, Philip J., i Matthew G. Dick. "Predicted Wheel Wear and RCF Performance Using VAMPIRE Automation Routines". W 2009 Joint Rail Conference. ASMEDC, 2009. http://dx.doi.org/10.1115/jrc2009-63058.
Pełny tekst źródłaRaporty organizacyjne na temat "Routing with profits"
Mahmassani, Hani, Christopher Cummings, Vasileios Volakakis, Laurence Audenaerd i Jessica De La Paz. Advancing Air Mobility in Illinois. Illinois Center for Transportation, luty 2024. http://dx.doi.org/10.36501/0197-9191/24-006.
Pełny tekst źródłaGalili, Naftali, Roger P. Rohrbach, Itzhak Shmulevich, Yoram Fuchs i Giora Zauberman. Non-Destructive Quality Sensing of High-Value Agricultural Commodities Through Response Analysis. United States Department of Agriculture, październik 1994. http://dx.doi.org/10.32747/1994.7570549.bard.
Pełny tekst źródłaEcuador: Use commercial marketing to increase sustainability. Population Council, 2001. http://dx.doi.org/10.31899/rh2001.1007.
Pełny tekst źródła