學術出版;;Publications

Permanent URI for this communityhdl:11536/1

收集所有交通大學研究人員與學生個人或團體所發表之各項學術著作，涵蓋期刊論文、教師專書、學位論文等項。;;Collections of Publications of NCTU Researchers and Students Like Journal Papers and Thesis.

Browse

🏛️國立陽明交通大學機構典藏

Search Results

Now showing 1 - 10 of 10

The optimal dispatching of taxis under congestion: a rolling horizon approach
(2006-03-01)
Wong, K. I.
;
Bell, Michael G. H.
;
運輸與物流管理系註：原交通所+運管所
;
Department of Transportation and Logistics Management
Taxis make an important contribution to transport in many parts of the world, offering demand-responsive, door-to-door transport. In larger cities, taxis may be hailed on-street or taken from taxi ranks. Elsewhere, taxis are usually ordered by phone. The objective of a taxi dispatcher is to maximize the efficiency of fleet utilization. While the spatial and temporal distribution of taxi requests has in general a high degree of predictability, real time traffic congestion information can be collected and disseminated to taxis by communication technologies. The efficiency of taxi dispatching may be significantly improved through the anticipation of future requests and traffic conditions. A rolling horizon approach to the optimisation of taxi dispatching is formulated, which takes the stochastic and dynamic nature of the problem into account. Numerical experiments are presented to illustrate the performances of the heuristics, taking the time dependency of travel times and passenger arrivals into account.
Effective dynamic dispatching rule and constructive heuristic for solving single-machine scheduling problems with a common due window
(2017)
Ying, Kuo-Ching
;
Linb, Shih-Wei
;
Lu, Chung-Cheng
;
運輸與物流管理系註：原交通所+運管所
;
Department of Transportation and Logistics Management
This study addresses the single-machine scheduling problem with a common due window (CDW) that has a constant size and position. The objective is to minimise the total weighted earliness-tardiness penalties for jobs completed out of the CDW. To determine a schedule as close to optimum as possible, this study develops a dynamic dispatching rule and an effective constructive heuristic. The better performance of the proposed heuristic is demonstrated by comparing the results of it with those of a state-of-the-art greedy heuristic on a well-known benchmark problem set. In addition, we incorporate the constructive heuristic into a best-so-far meta-heuristic to examine the benefit of the proposed heuristic. The results show that the best known solutions in 144 out of the 250 benchmark instances are improved.
Influence of information search on risky investment preferences: Testing a moderating role of income
(2011)
Tseng, Shun-Yao
;
Yang, Chyan
;
經營管理研究所
;
Institute of Business and Management
Risk-taking in investment decision-making is a major means to create individual wealth. Investors search information for risk-reducing strategies in risky investment decision-making. Digital information on financial measures and advice-seeking information are two usual means in information searching. This study extends the information search aspects.to discuss heuristics reliance to enrich our understanding of individual risk-taking in investment choices. A test for differences based on income is also conducted. In addition, this article discusses two forms of risky investments, stocks/options investments as well as mutual funds investments. We test our model with a sample of experienced investors by self-reported measurement. The findings thus expect to show that information searches and income have dramatic effects on investment preference variation. Accordingly, implications for financial consultants and ethics issues are discussed as well.
The fleet size and mix vehicle routing problem with time windows
(1999-07-01)
Liu, FH
;
Shen, SY
;
工業工程與管理學系
;
Department of Industrial Engineering and Management
This paper describes several insertion-based savings heuristics for the fleet size and mix vehicle routing problem with time window constraints. A certain number of candidate fleet compositions are recorded in the construction phase, followed by applying a composite improvement scheme on them to enhance the solution quality. Computational results on 168 sample problems are reported. We found that heuristics with the consideration of a sequential route construction parameter yielded very good results. In addition, results on the 20 benchmarking problems for the fleet and mix vehicle routing problem with no time window constraints also demonstrate the effectiveness of our heuristics.
An overview of a heuristic for vehicle routing problem with time windows
(1999-10-01)
Liu, FHF
;
Shen, SY
;
工業工程與管理學系
;
Department of Industrial Engineering and Management
In this paper, a two-stage metaheuristic based on a new neighborhood structure is proposed to solve the vehicle routing problem with time windows. Our neighborhood construction focuses on the relationship between route(s) and node(s). Unlike the conventional methods for parallel route construction, we construct routes in a nested parallel manner to obtain higher solution quality. Computational results for 60 benchmark problems are reported. The results indicate that our approach is highly competitive with all existing heuristics, in particular very promising for solving problems with large size. (C) 1999 Elsevier Science Ltd. All rights reserved.
Two-machine flowshop batching and scheduling
(2005-01-01)
Lin, BMT
;
Cheng, TCE
;
資訊管理與財務金融系註：原資管所+財金所
;
Department of Information Management and Finance
We consider in this paper a two-machine flowshop scheduling problem in which the first machine processes jobs individually while the second machine processes jobs in batches. The forming of each batch on the second machine incurs a constant setup time. The objective is to minimize the makespan. This problem was previously shown to be NP-hard in the ordinary sense. In this paper, we first present a strong NP-hardness result of the problem. We also identify a polynomially solvable case with either anticipatory or non-anticipatory setups. We then establish a property that an optimal solution for the special case is a lower bound for the general problem. To obtain near-optimal solutions for the general problem, we devise some heuristics. The lower bound is used to evaluate the quality of the heuristic solutions. Results of computational experiments reveal that the heuristics produce solutions with small error ratios. They also suggest that the lower bound is close to the optimal solution.
The role of information searches in investment choice variation: Digital information, advice seeking and heuristics
(2011-06-18)
Tseng, Shun-Yao
;
Yang, Chyan
;
交大名義發表
;
經營管理研究所
;
National Chiao Tung University
Purchasing risky investments can be a means to maximize individual wealth; but when faced with uncertainty about the investment outcome, individuals search for information on risk-reducing strategies. Most studies focus on digital information and advice-seeking information. This study extends the investigation of information search to discuss heuristics reliance, a simplified information search method. We also examine the effect of risk aversion on our extended information search model. The findings show that, individuals with more risk aversion tend to seek more information. More advice-seeking information search and heuristics reliance through a mass of digital information can increase investor's interest in mutual fund investments. The results demonstrate the value of enhancing the sophistication and accuracy of the information that a counselor provides, especially for investors who are risk averse. This study also has an implication for ethical issues.
The Mediating Role of Information Searches in Risky Investment Preferences: Does More Digital Information Search Have a Stronger Effect?
(2010)
Tseng, Shun-Yao
;
Yang, Chyan
;
經營管理研究所
;
Institute of Business and Management
Purchasing higher risk financial investments have been a means to maximize individual wealth. This phenomenon is seen while there is a high uncertainty about the higher risk financial investments. Facing uncertainty, an individual may assess psychological or economic loss, and then develop risk-reducing strategies. Viewing information searches as risk-reducing strategies in this study, we attempted to propose a mediated model of the determinants of higher risk investment decision making where theorizing that the effect of risk aversion on higher risk investment decisions was mediated by information searches. Moreover, heuristics, a simplified information research method, is proposed to extend information searches. 500 investors with investment experiment from financial holding companies were surveyed and structural equation modeling was employed. We expected that the results could provide empirical support for (1) greatly expanding our understanding for the heuristics reliance in information search, and (2) validating the usefulness of the mediated model which views information search as a mediator of effects on higher risk investment preferences, especially in the mediating role of professional advice and heuristics. Thus, the practical implications for professional advisors or governments could be addressed.
Scheduling in an assembly-type production chain with batch transfer
(2007-04-01)
Lin, B. M. T.
;
Cheng, T. C. E.
;
Chou, A. S. C.
;
資訊管理與財務金融系註：原資管所+財金所
;
Department of Information Management and Finance
This paper addresses a three-machine assembly-type flowshop scheduling problem, which frequently arises from manufacturing process management as well as from supply chain management. Machines one and two are arranged in parallel for producing component parts individually, and machine three is an assembly line arranged as the second stage of a flowshop for processing the component parts in batches. Whenever a batch is formed on the second-stage machine, a constant setup time is required. The objective is to minimize the makespan. In this study we establish the strong NP-hardness of the problem for the case where all the jobs have the same processing time on the second-stage machine. We then explore a useful property, based upon which a special case can be optimally solved in polynomial time. We also study several heuristic algorithms to generate quality approximate solutions for the general problem. Computational experiments are conducted to evaluate the effectiveness of the algorithms. (c) 2005 Elsevier Ltd. All rights reserved.
A hybrid shortest path algorithm for navigation system
(2007)
Cho, Hsun-Jung
;
Lan, Chien-Lun
;
運輸與物流管理系註：原交通所+運管所
;
Department of Transportation and Logistics Management
Combined with Geographic Information System (GIS) and Global Positioning System (GPS), the vehicle navigation system had become a quite popular product in daily life. A key component of the navigation system is the Shortest Path Algorithm. Navigation in real world must face a network consists of tens of thousands nodes and links, and even more. Under the limited computation capability of vehicle navigation equipment, it is difficult to satisfy the real-time response requirement that user expected. Hence, this study focused on shortest path algorithm that enhances the computation speed with less memory requirement. Several well-known algorithms such as Dijkstra, A* and hierarchical concepts were integrated to build hybrid algorithms that reduce searching space and improve searching speed. Numerical examples were conducted on Taiwan highway network that consists of more than four hundred thousands of links and nearly three hundred thousands of nodes. This real network was divided into two connected sub-networks (layers). The upper layer is constructed by freeways and expressways- the lower layer is constructed by local networks. Test origin-destination pairs were chosen randomly and divided into three distance categories; short, medium and long distances. The evaluation of outcome is judged by actual length and travel time. The numerical example reveals that the hybrid algorithm proposed by this research might be tens of thousands times faster than traditional Dijkstra algorithm; the memory requirement of the hybrid algorithm is also much smaller than the tradition algorithm. This outcome shows that this proposed algorithm would have an advantage over vehicle navigation system.

學術出版;;Publications

Browse

Filters

Settings

Sort By

Results per page

🏛️國立陽明交通大學機構典藏

Search Results